1996 | |
---|---|
[ACJ+96] | Parosh Aziz Abdulla,
Kārlis Čerāns,
Bengt Jonsson, and
Yih-Kuen Tsay.
General Decidability Theorems for Infinite-State
Systems.
In LICS'96,
pages 313-321.
IEEE Comp. Soc. Press, July 1996.
|
[AFH96] | Rajeev Alur, Tómas Feder, and Thomas A. Henzinger. The Benefits of Relaxing Punctuality. Journal of the ACM 43(1):116-146. ACM Press, January 1996. |
[AHH96] | Rajeev Alur,
Thomas A. Henzinger, and
Pei-Hsin Ho.
Automatic Symbolic Verification of Embedded Systems.
IEEE Transactions on Software Engineering 22(3):181-201. IEEE Comp. Soc. Press, March 1996.
|
[AJ96] | Parosh Aziz Abdulla and Bengt Jonsson. Verifying Programs with Unreliable Channels. Information and Computation 127(2):91-101. Academic Press, June 1996. |
[AO96] | Eric Allender and
Mitsunori Ogihara.
Relationships Among PL, #;L, and the
Determinant.
RAIRO – Theoretical Informatics and Applications 30(1):1-21. EDP Sciences, 1996.
|
[AT96] | Rajeev Alur and
Gadi Taubenfeld.
Fast Timing-based Algorithms.
Distributed Computing 10:1-10. Springer-Verlag, 1996.
|
[BEM96] | Julian C. Bradfield,
Javier Esparza, and
Angelika Mader.
An effective tableau system for the linear time
mu-calculus.
In ICALP'96,
Lecture Notes in Computer Science 1099, pages 98-109. Springer-Verlag, July 1996.
|
[BGK+96] | Johan Bengtsson,
W. O. David Griffioen,
Kåre J. Kristoffersen,
Kim Guldstrand Larsen,
Fredrik Larsson,
Paul Pettersson, and
Wang Yi.
Verification of an Audio Protocol with Bus Collision
Using Uppaal.
In CAV'96,
Lecture Notes in Computer Science 1102, pages 244-256. Springer-Verlag, July 1996.
|
[BGP96] | Béatrice Bérard, Paul Gastin, and Antoine Petit. Timed Automata with non Observable Actions: Expressive power and refinement. In STACS'96, Lecture Notes in Computer Science 1046, pages 257-268. Springer-Verlag, February 1996. |
[Bod96] | Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25(6):1305-1317. Society for Industrial and Applied Math., December 1996. |
[BT96] | Dimitri P. Bertsekas and
John N. Tsitsiklis.
Neuro-Dynamic Programming.
Anthropological Field Studies 3.
Athena Scientific, 1996.
|
[CFP+96] | Gérard Cécé,
Alain Finkel, and
S. Purushothaman Iyer.
Unreliable Channels are Easier to Verify Than
Perfect Channels.
Information and Computation 124(1):20-31. Academic Press, January 1996.
|
[CG96] | Boris V. Cherkassky and
Andrew V. Goldberg.
Negative-Cycle Detection Algorithm.
In ESA'96,
Lecture Notes in Computer Science 1136, pages 349-363. Springer-Verlag, September 1996.
|
[DOT+96] | Conrado Daws,
Alfredo Olivero,
Stavros Tripakis, and
Sergio Yovine.
The tool Kronos.
In HSCC'95,
Lecture Notes in Computer Science 1066, pages 208-219. Springer-Verlag, 1996.
|
[Eme96] | E. Allen Emerson.
Automated Temporal Reasoning about Reactive Systems.
In Banff'94,
Lecture Notes in Computer Science 1043, pages 41-101. Springer-Verlag, 1996.
|
[Eme96] | E. Allen Emerson.
Model Checking and the Mu-calculus.
In Neil Immerman and
Phokion G. Kolaitis (eds.),
Descriptive Complexity and Finite Models,
DIMACS Series in Discrete Mathematics and
Theoretical Computer Science 31, pages 185-214. American Mathematical Society, 1996.
|
[ES96] | E. Allen Emerson and A. Prasad Sistla. Symmetry and model checking. Formal Methods in System Design 9(1-2):105-131. Kluwer Academic, August 1996. |
[ET96] | E. Allen Emerson and
Richard J. Trefler.
Generalized Quantitative Temporal Reasoning.
Technical Report 96-20, Department of Computer Science, University of Texas
at Austin, USA,
1996.
|
[EW96] | Kousha Etessami and
Thomas Wilke.
An Until Hierarchy for Temporal Logic.
In LICS'96,
pages 108-117.
IEEE Comp. Soc. Press, July 1996.
|
[FHM+96] | Ronald Fagin,
Joseph Y. Halpern,
Yoram Moses, and
Moshe Y. Vardi.
Common Knowledge Revisited.
In TARK'96,
pages 283-298.
Morgan Kaufmann Publishers, March 1996.
|
[FKG96] | Jürgen Frößl,
Thomas Kropf, and
Joachim Gerlach.
An Efficient Algorithm for Real-Time Symbolic Model
Checking.
In ED&TC'96,
pages 15-20.
IEEE Comp. Soc. Press, March 1996.
|
[GKP+96] | Leszek Gąsieniec,
Marek Karpinski,
Wojciech Plandowski, and
Wojciech Rytter.
Efficient Algorithms for Lempel-Ziv Encoding
(Extended Abstract).
In SWAT'96,
Lecture Notes in Computer Science 1097, pages 392-403. Springer-Verlag, July 1996.
|
[Gor96] | Valentin Goranko.
Hierarchies of Modal and Temporal Logics with
Reference Pointers.
Journal of Logic, Language and Information 5(1):1-24. Kluwer Academic, April 1996.
|
[GPV+96] | Rob Gerth,
Doron A. Peled,
Moshe Y. Vardi, and
Pierre Wolper.
Simple On-the-fly Automatic Verification of Linear
Temporal Logic.
In PSTV'95,
IFIP Conference Proceedings 38, pages 3-18. Chapman & Hall, 1996.
|
[GRS+96] | Dora Giammarresi, Antonio Restivo, Sebastian Seibert, and Wolfgang Thomas. Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems. Information and Computation 125(1):32-45. Academic Press, February 1996. |
[Hen96] | Thomas A. Henzinger.
The Theory of Hybrid Automata.
In LICS'96,
pages 278-292.
IEEE Comp. Soc. Press, July 1996.
|
[HJ96] | Dang Van Hung and
Wang Ji.
On the Design of Hybrid Control Systems Using
Automata Models.
In FSTTCS'96,
Lecture Notes in Computer Science 1180, pages 156-176. Springer-Verlag, December 1996.
|
[HKV96] | Thomas A. Henzinger,
Orna Kupferman, and
Moshe Y. Vardi.
A Space-Efficient On-the-fly Algorithm for Real-Time
Model Checking.
In CONCUR'96,
Lecture Notes in Computer Science 1119, pages 514-529. Springer-Verlag, August 1996.
|
[HS96] | Klaus Havelund and
Natarajan Shankar.
Experiments in Theorem Proving and Model Checking
for Protocol Verification.
In FME'96,
Lecture Notes in Computer Science 1051, pages 662-681. Springer-Verlag, March 1996.
|
[JW96] | David Janin and
Igor Walukiewicz.
On the Expressive Completeness of the Propositional
Mu-Calculus With Respect to Monadic Second Order
Logic.
In CONCUR'96,
Lecture Notes in Computer Science 1119, pages 263-277. Springer-Verlag, August 1996.
|
[KG96] | Orna Kupferman and
Orna Grumberg.
Buy One, Get One Free!!!.
Journal of Logic and Computation 6(4):523-539. Oxford University Press, August 1996.
|
[KG96] | Orna Kupferman and
Orna Grumberg.
Branching Time Temporal Logic and Tree Automata.
Information and Computation 125(1):62-69. Academic Press, February 1996.
|
[KSV96] | Orna Kupferman, Shmuel Safra, and Moshe Y. Vardi. Relating Word and Tree Automata. In LICS'96, pages 322-332. IEEE Comp. Soc. Press, July 1996. |
[Moo96] | Cristopher Moore.
Recursion Theory on the Reals and Continuous-Time
Computation.
Theoretical Computer Science 162(1):23-44. Elsevier, August 1996.
|
[MS96] | Dov Monderer and Lloyd S. Shapley. Potential Games. Games and Economic Behavior 14(1):124-143. May 1996. |
[Pin96] | Jean-Éric Pin.
Logic, Semigroups and Automata on Words.
Annals of Mathematics and Artificial Intelligence 16:343-384. Kluwer Academic, 1996.
|
[SSL+96] | Meera Sampath, Raja Sengupta, Stéphane Lafortune, Kasim Sinnamohideen, and Demosthenis Teneketzis. Failure diagnosis using discrete-event models. IEEE Transactions on Computers 35(1):105-124. IEEE Comp. Soc. Press, January 1996. |
[TAK+96] | Serdar Taşiran,
Rajeev Alur,
Robert P. Kurshan, and
Robert K. Brayton.
Verifying Abstractions of Timed Systems.
In CONCUR'96,
Lecture Notes in Computer Science 1119, pages 546-562. Springer-Verlag, August 1996.
|
[Tho96] | Wolfgang Thomas.
Languages, Automata and Logics.
Technical Report 9607, Institut für Informatik und Praktische
Mathematik, Christian-Albrechts-Universität,
Kiel, Germany,
May 1996.
|
[Tre96] | Jan Tretmans. Test Generation with Inputs, Outputs, and Quiescence. In TACAS'96, Lecture Notes in Computer Science 1055, pages 127-146. Springer-Verlag, March 1996. |
[Tre96] | Jan Tretmans. Conformance Testing with Labelled Transition Systems: Implementation Relations and Test Generation. Computer Networks and ISDN Systems 29(1):49-79. Elsevier, 1996. |
[TW96] | Denis Thérien and
Thomas Wilke.
Temporal Logic and Semidirect Products: an Effective
Characterization of the Until Hierarchy.
In FOCS'96,
pages 256-263.
IEEE Comp. Soc. Press, October 1996.
|
[Var96] | Moshe Y. Vardi.
An Automata-Theoretic Approach to Linear Temporal
Logic.
In Banff'94,
Lecture Notes in Computer Science 1043, pages 238-266. Springer-Verlag, 1996.
|
[Wal96] | Igor Walukiewicz.
Pushdown Processes: Games and Model Checking.
In CAV'96,
Lecture Notes in Computer Science 1102, pages 234-263. Springer-Verlag, July 1996.
|
[Wal96] | Igor Walukiewicz. Monadic second order logic on tree-like structures. In STACS'96, Lecture Notes in Computer Science 1046, pages 401-413. Springer-Verlag, February 1996. |
[ZP96] | Uri Zwick and Mike Paterson. The Complexity of Mean Payoff Games on Graphs. Theoretical Computer Science 158(1-2):343-359. Elsevier, May 1996. |
Search
Displayed 46 resultsList of authors
- 1
- 2
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 1
- 1
- 5
- 3
- 2
- 1
- 1
- 1
- 1