Relevant bibliographies by topics / Temporal verification

Academic literature on the topic 'Temporal verification'

Author: Grafiati
Published: 4 June 2021
Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Temporal verification.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Temporal verification"

1

Yamada, Chikatoshi, Yasunori Nagata, and Zensho Nakao. "An Efficient Specification for System Verification." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 6 (November 20, 2006): 931–38. http://dx.doi.org/10.20965/jaciii.2006.p0931.

Full text
Abstract:
In design of complex and large scale systems, system verification has played an important role. In this article, we focus on specification process of model checking in system verifications. Modeled systems are in general specified by temporal formulas of computation tree logic, and users must know well about temporal specification because the specification might be complex. We propose a method by which specifications with temporal formulas are obtained inductively. We will show verification results using the proposed temporal formula specification method, and show that amount of memory, OBDD nodes, and execution time are reduced.
APA, Harvard, Vancouver, ISO, and other styles
2

Fix, L. "Verification of temporal properties." Journal of Logic and Computation 6, no. 3 (June 1, 1996): 343–61. http://dx.doi.org/10.1093/logcom/6.3.343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Brunet, Dominique, David Sills, and Barbara Casati. "A Spatio-Temporal User-Centric Distance for Forecast Verification." Meteorologische Zeitschrift 27, no. 6 (December 11, 2018): 441–53. http://dx.doi.org/10.1127/metz/2018/0883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kröger, F. "On temporal program verification rules." RAIRO. Informatique théorique 19, no. 3 (1985): 261–80. http://dx.doi.org/10.1051/ita/1985190302611.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sánchez, Alejandro, and César Sánchez. "Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems." Annals of Mathematics and Artificial Intelligence 80, no. 3-4 (November 15, 2016): 249–82. http://dx.doi.org/10.1007/s10472-016-9531-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhou, Min, William N. N. Hung, Xiaoyu Song, Ming Gu, and Jiaguang Sun. "Temporal Coverage Analysis for Dynamic Verification." IEEE Transactions on Circuits and Systems II: Express Briefs 65, no. 1 (January 2018): 66–70. http://dx.doi.org/10.1109/tcsii.2017.2746744.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abowd, Gregory D., and Lein Ton. "Automated verification of temporal dialogue properties." ACM SIGCHI Bulletin 28, no. 2 (April 1996): 50–52. http://dx.doi.org/10.1145/226650.226669.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kung, C. H. "On verification of database temporal constraints." ACM SIGMOD Record 14, no. 4 (May 1985): 169–79. http://dx.doi.org/10.1145/971699.318911.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fernández-Gago, M. C., U. Hustadt, C. Dixon, M. Fisher, and B. Konev. "First-Order Temporal Verification in Practice." Journal of Automated Reasoning 34, no. 3 (April 2005): 295–321. http://dx.doi.org/10.1007/s10817-005-7354-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dixon, Clare, Alan F. T. Winfield, Michael Fisher, and Chengxiu Zeng. "Towards temporal verification of swarm robotic systems." Robotics and Autonomous Systems 60, no. 11 (November 2012): 1429–41. http://dx.doi.org/10.1016/j.robot.2012.03.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Temporal verification"

1

Chen, Jinjun, and n/a. "Towards effective and efficient temporal verification in grid workflow systems." Swinburne University of Technology, 2007. http://adt.lib.swin.edu.au./public/adt-VSWT20070424.112326.

Full text
Abstract:
In grid architecture, a grid workflow system is a type of high-level grid middleware which aims to support large-scale sophisticated scientific or business processes in a variety of complex e-science or e-business applications such as climate modelling, disaster recovery, medical surgery, high energy physics, international stock market modelling and so on. Such sophisticated processes often contain hundreds of thousands of computation or data intensive activities and take a long time to complete. In reality, they are normally time constrained. Correspondingly, temporal constraints are enforced when they are modelled or redesigned as grid workflow specifications at build-time. The main types of temporal constraints include upper bound, lower bound and fixed-time. Then, temporal verification would be conducted so that we can identify any temporal violations and handle them in time. Conventional temporal verification research and practice have presented some basic concepts and approaches. However, they have not paid sufficient attention to overall temporal verification effectiveness and efficiency. In the context of grid economy, any resources for executing grid workflows must be paid. Therefore, more resources should be mainly used for execution of grid workflow itself rather than for temporal verification. Poor temporal verification effectiveness or efficiency would cause more resources diverted to temporal verification. Hence, temporal verification effectiveness and efficiency become a prominent issue and deserve an in-depth investigation. This thesis systematically investigates the limitations of conventional temporal verification in terms of temporal verification effectiveness and efficiency. The detailed analysis of temporal verification effectiveness and efficiency is conducted for each step of a temporal verification cycle. There are four steps in total: Step 1 - defining temporal consistency; Step 2 - assigning temporal constraints; Step 3 - selecting appropriate checkpoints; and Step 4 - verifying temporal constraints. Based on the investigation and analysis, we propose some new concepts and develop a set of innovative methods and algorithms towards more effective and efficient temporal verification. Comparisons, quantitative evaluations and/or mathematical proofs are also presented at each step of the temporal verification cycle. These demonstrate that our new concepts, innovative methods and algorithms can significantly improve overall temporal verification effectiveness and efficiency. Specifically, in Step 1, we analyse the limitations of two temporal consistency states which are defined by conventional verification work. After, we propose four new states towards better temporal verification effectiveness. In Step 2, we analyse the necessity of a number of temporal constraints in terms of temporal verification effectiveness. Then we design a novel algorithm for assigning a series of finegrained temporal constraints within a few user-set coarse-grained ones. In Step 3, we discuss the problem of existing representative checkpoint selection strategies in terms of temporal verification effectiveness and efficiency. The problem is that they often ignore some necessary checkpoints and/or select some unnecessary ones. To solve this problem, we develop an innovative strategy and corresponding algorithms which only select sufficient and necessary checkpoints. In Step 4, we investigate a phenomenon which is ignored by existing temporal verification work, i.e. temporal dependency. Temporal dependency means temporal constraints are often dependent on each other in terms of their verification. We analyse its impact on overall temporal verification effectiveness and efficiency. Based on this, we develop some novel temporal verification algorithms which can significantly improve overall temporal verification effectiveness and efficiency. Finally, we present an extension to our research about handling temporal verification results since these verification results are based on our four new temporal consistency states. The major contributions of this research are that we have provided a set of new concepts, innovative methods and algorithms for temporal verification in grid workflow systems. With these, we can significantly improve overall temporal verification effectiveness and efficiency. This would eventually improve the overall performance and usability of grid workflow systems because temporal verification can be viewed as a service or function of grid workflow systems. Consequently, by deploying the new concepts, innovative methods and algorithms, grid workflow systems would be able to better support large-scale sophisticated scientific and business processes in complex e-science and e-business applications in the context of grid economy.
APA, Harvard, Vancouver, ISO, and other styles
2

Soleimanifard, Siavash. "Procedure-Modular Verification of Temporal Safety Properties." Licentiate thesis, KTH, Teoretisk datalogi, TCS, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-93898.

Full text
Abstract:
This thesis presents a fully automated technique for procedure-modular verification of control flow temporal safety properties. Procedure-modular verification is a natural instantiation of modular verification where modularity is achieved at the level of procedures. Here it is used for the verification of software systems in the presence of code evolution, multiple method implementations (as arising from software product lines), or even unknown method implementations (as in mobile code for open platforms). The technique is built on top of a previously developed modular verification framework based on maximal model construction. In the framework, program data is abstracted away completely to achieve algorithmic verification. This restricts the class of properties that can be verified. The technique is supported by a fully automated tool called ProMoVer which is described and evaluated on a number of real-life case studies. ProMoVer is quipped with a number of features, such as automatic specification extraction, to facilitate easy usage. Moreover, it provides a proof storage and reuse mechanism for efficiency. An application area which can significantly benefit from modular verification is software product line (SPL) design. In SPL engineering, products are generated from a set of well-defined commonalities and variabilities. The products of an SPL can be described by means of a hierarchical variability model specifying the commonalities and variabilities between the individual products. The number of products generated from a hierarchical model is exponential in the size of the hierarchical model. Therefore, scalable and efficient verification for SPL is only possible by exploiting modular verification techniques. In this thesis, we propose a hierarchical variability model for modeling product families. Then the modular verification technique and ProMoVer are adapted for the SPLs described with this hierarchical model. A natural extension of the modular verification technique is to include program data in a conservative fashion, by encoding data from a finite domain through control. By this, a wider class of properties can be supported. As a first step towards including program data, Boolean values are added to the program model, specification languages, maximal model construction and modular verification principles.
QC 20120507
APA, Harvard, Vancouver, ISO, and other styles
3

Jin, S. "Temporal logic specification and verification of communication protocols." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378819.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bruns, Glen R. "Process abstraction in the verification of temporal properties." Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/384.

Full text
Abstract:
The automatic verification of temporal properties of systems usually suffers from two problems. First, the size of the system that can be verified is very limited. Secondly, the results reflect only the behaviour of a system having particular parameters and initial conditions. Both problems are addressed by abstracting the system model relative to the property of interest. This thesis investigates two abstraction methods for processes. In the first method unary process operators serve as abstraction operations. We show that an abstract process satisfies a property expressed as a temporal logic formula just if the original process satisfies a transformed formula. We define various abstraction operators and illustrate their use in verification with examples. The method is also used to derive two well-known verification techniques. In the second method an abstract process and the original process are related by a process preorder. The weakly simulates and ready simulates preorders are used. For both we provide logical characterisations, abstraction operations, and algebraic laws. Our work differs from existing work on process abstraction in that we abstract process expressions directly and take account of the particular property to be verified. We show the practical value of our methods by using them to help verify properties of Dekker's mutual exclusion algorithm and Ben-Ari's concurrent garbage collection algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Harvey, Randall A. "Verification of concurrent system specifications using temporal logic." Thesis, University of Ottawa (Canada), 1989. http://hdl.handle.net/10393/5662.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bolotov, Alexander. "Clausal resolution for branching-time temporal logic." Thesis, Manchester Metropolitan University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.311209.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Brochenin, Rémi. "Separation logic : expressiveness, complexity, temporal extension." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2013. http://tel.archives-ouvertes.fr/tel-00956587.

Full text
Abstract:
This thesis studies logics which express properties on programs. These logics were originally intended for the formal verification of programs with pointers. Overall, no automated verification method will be proved tractable here- rather, we give a new insight on separation logic. The complexity and decidability of some essential fragments of this logic for Hoare triples were not known before this work. Also, its combination with some other verification methods was little studied. Firstly, in this work we isolate the operator of separation logic which makes it undecidable. We describe the expressive power of this logic, comparing it to second-order logics. Secondly, we try to extend decidable subsets of separation logic with a temporal logic, and with the ability to describe data. This allows us to give boundaries to the use of separation logic. In particular, we give boundaries to the creation of decidable logics using this logic combined with a temporal logic or with the ability to describe data.
APA, Harvard, Vancouver, ISO, and other styles
8

Koleini, Masoud. "Verification of temporal-epistemic properties of access control systems." Thesis, University of Birmingham, 2012. http://etheses.bham.ac.uk//id/eprint/3706/.

Full text
Abstract:
Verification of access control systems against vulnerabilities has always been a challenging problem in the world of computer security. The complication of security policies in large- scale multi-agent systems increases the possible existence of vulnerabilities as a result of mistakes in policy definition. This thesis explores automated methods in order to verify temporal and epistemic properties of access control systems. While temporal property verification can reveal a considerable number of security holes, verification of epistemic properties in multi-agent systems enable us to infer about agents' knowledge in the system and hence, to detect unauthorized information flow. This thesis first presents a framework for knowledge-based verification of dynamic access control policies. This framework models a coalition-based system, which evaluates if a property or a goal can be achieved by a coalition of agents restricted by a set of permissions defined in the policy. Knowledge is restricted to the information that agents can acquire by reading system information in order to increase time and memory efficiency. The framework has its own model-checking method and is implemented in Java and released as an open source tool named \(\char{cmmi10}{0x50}\)\(\char{cmmi10}{0x6f}\)\(\char{cmmi10}{0x6c}\)\(\char{cmmi10}{0x69}\)\(\char{cmmi10}{0x56}\)\(\char{cmmi10}{0x65}\)\(\char{cmmi10}{0x72}\). In order to detect information leakage as a result of reasoning, the second part of this thesis presents a complimentary technique that evaluates access control policies over temporal-epistemic properties where the knowledge is gained by reasoning. We will demonstrate several case studies for a subset of properties that deal with reasoning about knowledge. To increase the efficiency, we develop an automated abstraction refinement technique for evaluating temporal-epistemic properties. For the last part of the thesis, we develop a sound and complete algorithm in order to identify information leakage in Datalog-based trust management systems.
APA, Harvard, Vancouver, ISO, and other styles
9

Bouaziz, Hamida. "Adaptation of SysML Blocks and Verification of Temporal Properties." Thesis, Besançon, 2016. http://www.theses.fr/2016BESA2015/document.

Full text
Abstract:
Le travail présenté dans cette thèse a lieu dans le domaine de développement basé sur les composants, il est une contribution à laspécification, l'adaptation et la vérification des systèmes à base de composants. Le but principal de cette thèse est la proposition d'uneapproche formelle pour construire progressivement des systèmes complexes en assemblant et en adaptant un ensemble de composants,où leur structure et leur comportement sont modélisés à l'aide de diagrammes SysML. Dans la première étape, nous avons défini uneapproche basée sur la méta-modélisation et la transformation des modèles pour vérifier la compatibilité des blocs ayant leurs protocolesd'interaction modélisés à l'aide de diagrammes de séquence SysML. Pour vérifier leur compatibilité, nous effectuons une transformationen automates d'interface (IAs), et nous utilisons l'approche optimiste définie sur les IA. Cette approche considère que deux composantssont compatibles s'il existe un environnement approprié avec lequel ils peuvent interagir correctement. Après cela, nous avons proposéde bénéficier de la hiérarchie, qui peut être présente dans les modèles de protocole d'interaction des blocs, pour alléger la vérification dela compatibilité des blocs. Dans l'étape suivante, nous avons pris en considération le problème des incohérences de noms de type one2oneentre les services des blocs. A ce stade, un adaptateur est généré pour un ensemble de blocs réutilisés qui ont leurs protocoles d'interactionmodélisés formellement par des automates d'interface. La génération de l'adaptateur est guidée par la spécification du bloc parent qui estfaite initialement par le concepteur. Notre approche est complétée par une phase de vérification qui nous permet de vérifier les exigencesSysML, exprimées formellement par les propriétés temporelles, sur les blocs SySML. Dans cette phase, nous avons exploité uniquementles adaptateurs générés pour vérifier la préservation des exigences initialement satisfaites par les blocs réutilisés. Ainsi, notre approchea l'intention de donner plus de chance d'éviter le problème de l'explosion de l'espace d'état au moment de la vérification. Dans le mêmecontexte, où nous avons un ensemble de blocs réutilisés et la spécification de leurs blocs parents, nous avons proposé d'utiliser des réseauxde Petri colorés (CPN) pour modéliser les interactions des blocs et générer des adaptateurs qui résolvent plus de types de problèmes. Dansce cas, l'adaptateur peut résoudre le problème de blocage en permettant le ré-ordonnancement des appels de services
The work presented in this thesis takes place in the component-based development domain, it is a contribution to the specification,adaptation and verification of component-based systems. The main purpose of this thesis is the proposition of a formal approach tobuild incrementally complex systems by assembling and adapting a set of components, where their structure and behaviour are modelledusing SysML diagrams. In the first stage, we have defined a meta-model driven approach which is based on meta-modelling and modelstransformation, to verify the compatibility of blocks having their interaction protocols modelled using SysML sequence diagrams. To verifytheir compatibility, we perform a transformation into interface automata (IAs), and we base on the optimistic approach defined on IAs. Thisapproach consider that two components are compatible if there is a suitable environment with which they can interact correctly. Afterthat, we have proposed to benefit from the hierarchy, that may be present in the interaction protocol models of the blocks, to alleviate theverification of blocks compatibility. In the next stage, we have taken into consideration the problem of names mismatches of type one2onebetween services of blocks. At this stage, an adapter is generated for a set of reused blocks which have their interaction protocols modelledformally by interface automata. The generation of the adapter is guided by the specification of the parent block which is made initiallyby the designer. Our approach is completed by a verification phase which allows us to verify SysML requirements, expressed formallyby temporal properties, on SySML blocks. In this phase, we have exploited only the generated adapters to verify the preservation of therequirements initially satisfied by the reused blocks. Thus, our approach intends to give more chance to avoid the state space explosionproblem during the verification. In the same context, where we have a set of reused blocks and the specification of their parent blocks, wehave proposed to use coloured Petri nets (CPNs) to model the blocks interactions and to generate adapters that solve more type of problems.In this case the adapter can solve the problem of livelock by enabling the reordering of services calls
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Jinjun. "Towards effective and efficient temporal verification in grid workflow systems." Australasian Digital Thesis Program, 2007. http://adt.lib.swin.edu.au/public/adt-VSWT20070424.112326/index.html.

Full text
Abstract:
Thesis (Ph.D) - Swinburne University of Technology, Faculty of Information & Communication Technologies, Centre for Information Technology Research, 2007.
A thesis to CITR - Centre for Information Technology Research, Faculty of Information and Communication Technologies, Swinburne University of Technology, for the degree of Doctor of Philosophy, 2007. Typescript. Bibliography p. 145-160.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Temporal verification"

1

Manna, Zohar, and Amir Pnueli. Temporal Verification of Reactive Systems. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4222-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Manna, Zohar. Temporal Verification of Reactive Systems: Safety. New York, NY: Springer New York, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Manna, Zohar. Temporal verification of reactive systems: Safety. New York: Springer, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kaplan, Simon M. Verification of recursive programs: A temporal proof approach. Urbana, Ill. (1304 W. Springfield Ave., Urbana 61801): Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bradfield, J. C. Verifying temporal properties of systems. Boston: Birkhäuser, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Andrianopoulos, G. An environment for the verification and code generation of temporal rules. Manchester: UMIST, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Naik, Yogesh. A temporal logic for the specification and verification of real-time systems. [s.l.]: typescript, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pnueli, Amir, and Zohar Manna. Temporal Verification of Reactive Systems: Safety. Springer, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Penczek, Wojciech, and Agata Pólrola. Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

A Formal Framework For Runtime Verification Of Web Applications An Approach Supported By Scopeextended Linear Temporal Logic. VDM Verlag, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Temporal verification"

1

Bucur, Doina. "Temporal Monitors for TinyOS." In Runtime Verification, 96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35632-2_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Donzé, Alexandre. "On Signal Temporal Logic." In Runtime Verification, 382–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40787-1_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Manna, Zohar, and Amir Pnueli. "Temporal verification diagrams." In Lecture Notes in Computer Science, 726–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57887-0_123.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bérard, Béatrice, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, and Pierre Mckenzie. "Temporal Logic." In Systems and Software Verification, 27–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04558-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Schneider, Klaus. "Temporal Logics." In Verification of Reactive Systems, 279–403. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-10778-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chan, William. "Temporal-logic Queries." In Computer Aided Verification, 450–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10722167_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Vardi, Moshe Y. "Unified verification theory." In Temporal Logic in Specification, 202–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51803-7_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bombara, Giuseppe, and Calin Belta. "Signal Clustering Using Temporal Logics." In Runtime Verification, 121–37. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67531-2_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tabakov, Deian, and Moshe Y. Vardi. "Optimized Temporal Monitors for SystemC." In Runtime Verification, 436–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16612-9_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. "Parametric Identification of Temporal Properties." In Runtime Verification, 147–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29860-8_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Temporal verification"

1

Sanchez, Alejandro, and Cesar Sanchez. "Parametrized Verification Diagrams." In 2014 21st International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2014. http://dx.doi.org/10.1109/time.2014.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Case, Michael L., Hari Mony, Jason Baumgartner, and Robert Kanzelman. "Enhanced verification by temporal decomposition." In 2009 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2009. http://dx.doi.org/10.1109/fmcad.2009.5351146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Barnat, Jiri, Petr Bauch, and Vojtech Havel. "Temporal Verification of Simulink Diagrams." In 2014 IEEE 15th International Symposium on High-Assurance Systems Engineering (HASE). IEEE, 2014. http://dx.doi.org/10.1109/hase.2014.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Xiaoxiao, and Zhenhua Duan. "Axiomatic Temporal Logic Programs Verification." In 2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2010. http://dx.doi.org/10.1109/tase.2010.10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gupta, Anshul, and Sven Schewe. "Quantitative Verification in Rational Environments." In 2014 21st International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2014. http://dx.doi.org/10.1109/time.2014.9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kung, C. H. "On verification of database temporal constraints." In the 1985 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 1985. http://dx.doi.org/10.1145/318898.318911.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hartmann, G., and S. Drue. "Verification of continuity, using temporal code." In 1990 IJCNN International Joint Conference on Neural Networks. IEEE, 1990. http://dx.doi.org/10.1109/ijcnn.1990.137755.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bollig, Benedikt. "Towards Formal Verification of Distributed Algorithms." In 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2015. http://dx.doi.org/10.1109/time.2015.23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dixon, C., M. Fisher, and B. Konev. "Is There a Future for Deductive Temporal Verification?" In Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06). IEEE, 2006. http://dx.doi.org/10.1109/time.2006.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Wen, Yongjian Wu, Haijun Liu, Shiguang Wang, and Jian Cheng. "Temporal Action Detection by Joint Identification-Verification." In 2018 24th International Conference on Pattern Recognition (ICPR). IEEE, 2018. http://dx.doi.org/10.1109/icpr.2018.8545487.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Temporal verification"

1

Fix, Limor, and Orna Grumberg. Verification of Temporal Properties. Fort Belvoir, VA: Defense Technical Information Center, April 1994. http://dx.doi.org/10.21236/ada278869.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Manna, Zohar. Temporal Verification and Development of Reactive Programs. Fort Belvoir, VA: Defense Technical Information Center, November 1996. http://dx.doi.org/10.21236/ada329718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Temporal verification' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography