A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
An automata-theoretic approach to branching-time model checking (Extended abstract)
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification ...
Moreover, the simple combinatorial structure that emerges from the automata-theoretic approach opens up new possibilities for the implementation of branching-time model checking, and has enabled us to ...
Unfortunately, the automata-theoretic approach does not seem to be applicable to branching-time model checking. ...
doi:10.1007/3-540-58179-0_50
fatcat:uwvhl43uvjht3ok7epblznjduy
Abstracting abstract control
2014
Proceedings of the 10th ACM Symposium on Dynamic languages - DLS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
However, these automata theoretic models either break down on features that inspect or modify the control stack. ...
We revise the abstracting abstract machines technique to target the stronger computational model of pushdown systems. In place of automata theory, we use only abstract machines and memoization. ...
We bypass the automata theoretic approach so that we are not chained to a pushdown automaton to model features such as first-class composable control operators. ...
doi:10.1145/2661088.2661098
dblp:conf/dls/JohnsonH14
fatcat:jftogwomxjhs3ob62mihglncom
αSPIN: Extending SPIN with Abstraction
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents the details of αspin, an xml-based tool to abstract promela models in order to employ spin as an abstract model checking tool. αspin is built on the top of spin which allows us to take ...
One direction for abstracting a system is to transform its formal description (its model) into a simpler version specified in the same language, thus skipping the construction of a specific (model checking ...
This paper presents an approach to extend explicit model checkers with abstraction capabilities. ...
doi:10.1007/3-540-46017-9_24
fatcat:jffej57r4zge3ajup6d3mbf4l4
Efficient temporal reasoning (extended abstract)
1989
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
in polynomial time. ...
This is due to the potential applications of such decision procedures to mechanical reasoning about correctness of concurrent programs. ...
[MP82], [MP83]), it was obvious to us that there was an efficient decision procedure implicit in their informal proof methods. ...
doi:10.1145/75277.75292
dblp:conf/popl/EmersonSS89
fatcat:lx2gf47mcbhhvht6m2bhor2uoq
Memory-efficient and self-stabilizing network RESET (extended abstract)
1994
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
The de nition was extended to shared memory model in DIM90 and to messagepassing model in AB89, KP90, APV91, Var-92 . ...
The theoretical formulation of this model was put forth by Dijkstra Dij74 , who, roughly, de ned the network to be self-stabilizing" if starting from an arbitrary initial state i.e., after any sequence ...
doi:10.1145/197917.198104
dblp:conf/podc/AwerbuchO94
fatcat:q6mrjynhrvfjtizawkcajaowhi
Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic (Extended Abstract)
2016
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2016 pre-print arXiv:1606.08815v1 fatcat:gztceu5ij5gspabdbfvk73woom
We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed ...
We show that mild generalizations of the known decidable cases suffice to render the model checking problem definitively undecidable. ...
An alternative approach is to work in a setting with more explicit references to time, by using variables denoting time points. ...
doi:10.4204/eptcs.215.19
fatcat:ntw5fzc7uve3nonf2cz35ptsga
Process Behaviour: Formulae vs. Tests (Extended Abstract)
2010
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Here we compare these two approaches, using extensional testing in the style of DeNicola, Hennessy, and a recursive version of the property logic HML. ...
An alternative approach to process behaviour is based on tests, [DH84] . ...
Each time an instruction is executed, the content of the computer's memory is updated. ...
doi:10.4204/eptcs.41.3
fatcat:txsrzb2zoree5lbpjiyx4okq3m
How to Be Both Rich and Happy: Combining Quantitative and Qualitative Strategic Reasoning about Multi-Player Games (Extended Abstract)
2013
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We propose a logical framework combining a game-theoretic study of abilities of agents to achieve quantitative objectives in multi-player games by optimizing payoffs or preferences on outcomes with a logical ...
We enrich concurrent game models with payoffs for the normal form games associated with the states of the model and propose a quantitative extension of the logic ATL* enabling the combination of quantitative ...
checking of any QATL-formula in an GCGMP to a model checking of an ATL-formula in a CGM. ...
doi:10.4204/eptcs.112.8
fatcat:hpx5eqshsnditohhw5d6eaf6x4
TACAS 2003 Special Issue—Preface
2006
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Using timed automata for scheduling: Model checking is usually thought of as a verification technique. ...
Also considering the application of timed automata to scheduling of real-time systems, Fersman, Mokrushin, Pettersson, and Yi address a key issue in this approach to scheduling: the number of timed-automata ...
Conclusion We would like to thank heartily the referees for their expertise and their commitment to the quality of the present special issue. ...
doi:10.1016/j.tcs.2005.11.014
fatcat:wayjlqolubgvpkwhidau222pha
Page 4192 of Mathematical Reviews Vol. , Issue 2001F
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
approach to branching-time model checking. ...
Using a linear-time translation from branching-time temporal logic to alternating tree automata, model checking is translated into a l|-letter nonemptiness problem for word automata. ...
Page 5384 of Mathematical Reviews Vol. , Issue 94i
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Cerny, Comparing generic state machines (466-476); Gjalt G. de Jong, An automata-theoretic approach to temporal logic (477-487). ...
regular temporal logic for model checking with linear time complexity (253-262); Victor Yodaiken, The algebraic feedback product of automata (extended abstract) (263-271). ...
Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond
2020
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2001.06942v1 fatcat:6c7lsfalb5fanluvezt7nvsqkq
Along the last two decades a variety of theoretical achievements and automated techniques have contributed to make quantitative modeling and verification mainstream in the research community. ...
Hence, they need to be integrated both at the level of system modeling and within the verification methodologies and tools. ...
An interesting general formal framework is given by a modal specification theory for combined probabilistic timed systems, called abstract probabilistic timed automata, which generalizes existing formalisms ...
doi:10.4204/eptcs.312.1
fatcat:4fjvygbppjbq3k5ury2kvue3nq
An Automata-based Approach for CTL⋆ With Constraints
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These constraints allow to compare values of variables at different states of the model. We define an automata-theoretic approach to solve verification problems for such extensions. ...
We apply this approach to prove decidability and optimal complexity results for particular instances of CTL * extensions whenever an abstraction of the models verifying a "nice" property can be computed ...
The automata-based approach we propose relies on an abstraction of the models w.r.t. φ. The first step is to abstract valuations of the form Terms → D. ...
doi:10.1016/j.entcs.2009.05.040
fatcat:qgr2cwvolrbuzf6zyzbqjwbmwq
Page 2784 of Mathematical Reviews Vol. , Issue 2002D
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The second step uses model checking to establish that the abstracted automaton is infeasible, i.e., has no computations. ...
We refer to the extended method as verification by augmented abstraction (VAA). ...
Page 472 of Mathematical Reviews Vol. , Issue 98A
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Henzinger, The theory of hybrid automata (278- 292); Bernard Willems and Pierre Wolper, Partial-order methods for model checking: from linear time to branching time (294-303); Girish Bhat and Rance Cleaveland ...
(174-183); Rowan Davies, A temporal-logic approach to binding-time analysis (184-195); Patrice Godefroid and David E. ...
« Previous
Showing results 1 — 15 out of 6,015 results