-
4
-
-
84935629898
-
-
O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, pp. 97–107, New Orleans, January 1985.
-
-
-
-
5
-
-
84935661590
-
-
J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proceedings of the 5th International Symposium on Programming. Lecture Notes in Computer Science, 137:337–351 (1981).
-
-
-
-
6
-
-
84935667617
-
-
M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the symposium on Logic in Computer Science, pp. 322–331, Cambridge, June 1986.
-
-
-
-
7
-
-
84935674915
-
-
A. Bouajjani, J.-C. Fernandez, S. Graf, C. Rodriguez, and J. Sifakis. Safety for branching semantics. In Proceedings of the 12th International Colloquium on Automata, Language and Programming. Lecture Notes in Computer Science, (1991).
-
-
-
-
9
-
-
84935658127
-
-
C. Jard and T. Jeron. On-line model-checking for finite linear temporal logic specifications. In Automatic Verification Methods for Finite State Systems, Proceedings of an International Workshop, Grenoble. Lecture Notes in Computer Science, 407:189–196 (1989).
-
-
-
-
12
-
-
84935629165
-
-
Shmuel Safra. On the complexity of omega-automata. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, White Plains (October 1988).
-
-
-
-
14
-
-
84935669012
-
-
P. Godefroid and P. Wolper. A partial approach to model checking. In Proceedings of the 6th Symposium on Logic in Computer Science, pp. 406–415, Amsterdam, July 1991.
-
-
-
-
15
-
-
84935672411
-
-
A. Valmari. A stubborn attack on state explosion. In Proceedings of the 2nd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, 531:156–165 (1990).
-
-
-
-
16
-
-
84935661831
-
-
P. Godefroid. Using partial orders to improve automatic verification methods. In Proceedings of the 2nd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, 531:176–185 (1990).
-
-
-
-
17
-
-
84935671854
-
-
D.K. Probst and H.F. Li. Using partial-order semantics to avoid the state explosion problem in asynchronous systems. In Proceedings of the 2nd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, 531:146–155 (1990).
-
-
-
-
18
-
-
84935646034
-
-
A. Valmari. Stubborn sets for reduced state space generation. In Proceedings of the 10th International Conference on Application and Theory of Petri Nets, vol. 2, pp. 1–22, Bonn, 1989.
-
-
-
-
19
-
-
84935645064
-
-
A. Mazurkiewcz. Trace theory. In Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course. Lecture Notes in Computer Science, 255:279–324 (1986).
-
-
-
-
20
-
-
84935618200
-
-
A. Valmari. Error detection by reduced reachability graph detection. In Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, pp. 95–112, Venice, 1988.
-
-
-
-
21
-
-
84935675016
-
-
C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. In Proceedings of the 2nd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, 531:233–242 (1990).
-
-
-
-
22
-
-
84935660087
-
-
N. Halbwachs, D. Pilaud, F. Ouabdesselam, and A.C. Glory. Specifying, programming and verifying real-time systems, using a synchronous declarative language. In Workshop on Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science, 407:213–231 (1989).
-
-
-
-
23
-
-
84935646884
-
-
J.C. Fernandez and L. Mounier. On the fly verification of behavioural equivalences and preorders. In Proceedings of the 3rd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, 575:181–191, (1991).
-
-
-
-
24
-
-
84935630749
-
-
C. Jard and T. Jeron. Bounded-memory algorithms for verification on the fly. In Proceedings of the 3rd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, 575:192–202 (1991).
-
-
-
-
25
-
-
84935639205
-
-
H. Gaifman. Modeling concurrency by partial orders and nonlinear transition systems. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science, 354:467–488 (1988).
-
-
-
-
26
-
-
84935674131
-
-
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.
-
-
-
-
27
-
-
84935652901
-
-
S. Graf and B. Steffen. Using interface specifications for compositional reduction. In Proceedings of the 2nd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, 531:186–196 (1990).
-
-
-
-
32
-
-
84935625245
-
-
P. Godefroid, G.J. Holzmann, and D. Pirottin. State space caching revisited. In Proceedings of the 4th Workshop on Computer Aided Verification, Montreal, June 1992.
-
-
-
-
33
-
-
84935613972
-
-
P. Godefroid and F. Kabanza. An efficient reactive planner for synthesizing reactive plans. In Proceedings of AAAI-91, Vol. 2, pp. 640–645, Anaheim, July 1991.
-
-
-
-
34
-
-
84935653142
-
-
P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. In Proceedings of the 3rd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, 575:332–342 (1991).
-
-
-
|