skip to main content
Skip header Section
Computer-aided verification of coordinating processes: the automata-theoretic approachDecember 1994
Publisher:
  • Princeton University Press
  • 41 William St. Princeton, NJ
  • United States
ISBN:978-0-691-03436-2
Published:04 December 1994
Pages:
270
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Zhang X, Xiao S, Li J, Pu G and Strichman O Combining BMC and Complementary Approximate Reachability to Accelerate Bug-Finding Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, (1-9)
  2. Cabodi G, Camurati P, Palena M, Pasini P and Vendraminetto D (2020). Reducing Interpolant Circuit Size Through SAT-Based Weakening, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39:7, (1524-1531), Online publication date: 1-Jul-2020.
  3. Wei X and Li Y (2017). Fuzzy alternating Bchi automata over distributive lattices, International Journal of Approximate Reasoning, 90:C, (144-162), Online publication date: 1-Nov-2017.
  4. Doucet F and Kurshan R (2017). A methodology to take credit for high-level verification during RTL verification, Formal Methods in System Design, 51:2, (395-418), Online publication date: 1-Nov-2017.
  5. ACM
    Attie P, Bensalem S, Bozga M, Jaber M, Sifakis J and Zaraket F (2018). Global and Local Deadlock Freedom in BIP, ACM Transactions on Software Engineering and Methodology, 26:3, (1-48), Online publication date: 31-Jul-2017.
  6. Cimatti A, Griggio A, Mover S and Tonetta S (2016). Infinite-state invariant checking with IC3 and predicate abstraction, Formal Methods in System Design, 49:3, (190-218), Online publication date: 1-Dec-2016.
  7. Cabodi G, Camurati P, Palena M, Pasini P and Vendraminetto D Reducing interpolant circuit size by ad-hoc logic synthesis and SAT-based weakening Proceedings of the 16th Conference on Formal Methods in Computer-Aided Design, (25-32)
  8. Blahoudek F, Heizmann M, Schewe S, Strejček J and Tsai M Complementing Semi-deterministic Büchi Automata Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9636, (770-787)
  9. Namjoshi K and Trefler R Parameterized Compositional Model Checking Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9636, (589-606)
  10. Zhang Y, Zhu Z, Zhang J and Zhou Y (2015). Axiomatizing Lüttgen & Vogler's ready simulation for finite processes in CLLR, Journal of Applied Logic, 13:4, (654-675), Online publication date: 1-Dec-2015.
  11. Lee S and Sakallah K Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559, (849-865)
  12. Si Y, Sun J, Liu Y, Dong J, Pang J, Zhang S and Yang X (2014). Model checking with fairness assumptions using PAT, Frontiers of Computer Science: Selected Publications from Chinese Universities, 8:1, (1-16), Online publication date: 1-Feb-2014.
  13. Tian C and Duan Z Detecting spurious counterexamples efficiently in abstract model checking Proceedings of the 2013 International Conference on Software Engineering, (202-211)
  14. Loiacono C, Palena M, Pasini P, Patti D, Quer S, Ricossa S, Vendraminetto D and Baumgartner J Fast cone-of-influence computation and estimation in problems with multiple properties Proceedings of the Conference on Design, Automation and Test in Europe, (803-806)
  15. ACM
    Boker U and Kupferman O (2012). Translating to Co-Büchi Made Tight, Unified, and Useful, ACM Transactions on Computational Logic, 13:4, (1-26), Online publication date: 1-Oct-2012.
  16. Dennunzio A, Formenti E and Provillard J Acceptance conditions for ω-languages Proceedings of the 16th international conference on Developments in Language Theory, (320-331)
  17. Brázdil T, Chatterjee K, Kučera A and Novotný P Efficient controller synthesis for consumption games with multiple resource types Proceedings of the 24th international conference on Computer Aided Verification, (23-38)
  18. Li J, Xie F, Ball T, Levin V and McGarvey C Formalizing hardware/software interface specifications Proceedings of the 26th IEEE/ACM International Conference on Automated Software Engineering, (143-152)
  19. Ivancic F, Balakrishnan G, Gupta A, Sankaranarayanan S, Maeda N, Tokuoka H, Imoto T and Miyazaki Y DC2 Proceedings of the 26th IEEE/ACM International Conference on Automated Software Engineering, (133-142)
  20. Balakrishnan G, Maeda N, Sankaranarayanan S, Ivančić F, Gupta A and Pothengil R Modeling and analyzing the interaction of C and C++ strings Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software, (67-85)
  21. Avni G and Kupferman O An abstraction-refinement framework for trigger querying Proceedings of the 18th international conference on Static analysis, (263-279)
  22. Tian C and Duan Z Making abstraction-refinement efficient in model checking Proceedings of the 17th annual international conference on Computing and combinatorics, (402-413)
  23. ACM
    Ball T, Levin V and Rajamani S (2011). A decade of software model checking with SLAM, Communications of the ACM, 54:7, (68-76), Online publication date: 1-Jul-2011.
  24. ACM
    Nguyen M, Wedler M, Stoffel D and Kunz W Formal hardware/software co-verification by interval property checking with abstraction Proceedings of the 48th Design Automation Conference, (510-515)
  25. Köster M and Lohmann P Abstraction for model checking modular interpreted systems over ATL Proceedings of the 9th international conference on Programming Multi-Agent Systems, (95-113)
  26. Köster M and Lohmann P Abstraction for model checking modular interpreted systems over ATL The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3, (1129-1130)
  27. ACM
    Henzinger T, Singh V, Wies T and Zufferey D Scheduling large jobs by abstraction refinement Proceedings of the sixth conference on Computer systems, (329-342)
  28. Li J, Xie F, Ball T and Levin V Model checking büchi pushdown systems Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software, (141-155)
  29. Boker U and Kupferman O Co-büching them all Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software, (184-198)
  30. ACM
    Ong C and Ramsay S Verifying higher-order functional programs with pattern-matching algebraic data types Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (587-598)
  31. ACM
    Sinha N and Wang C On interference abstractions Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (423-434)
  32. ACM
    Ong C and Ramsay S (2011). Verifying higher-order functional programs with pattern-matching algebraic data types, ACM SIGPLAN Notices, 46:1, (587-598), Online publication date: 26-Jan-2011.
  33. ACM
    Sinha N and Wang C (2011). On interference abstractions, ACM SIGPLAN Notices, 46:1, (423-434), Online publication date: 26-Jan-2011.
  34. Yang Z and Sakallah K Trace-driven verification of multithreaded programs Proceedings of the 12th international conference on Formal engineering methods and software engineering, (404-419)
  35. Urdahl J, Stoffel D, Bormann J, Wedler M and Kunz W Path predicate abstraction by complete interval property checking Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design, (207-215)
  36. Sinha N Modular bug detection with inertial refinement Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design, (199-206)
  37. Een N, Mishchenko A and Amla N A single-instance incremental SAT formulation of proof- and counterexample-based abstraction Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design, (181-188)
  38. Böhm P A framework for incremental modelling and verification of on-chip protocols Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design, (159-166)
  39. Almagor S, Hirshfeld Y and Kupferman O Promptness in w-regular automata Proceedings of the 8th international conference on Automated technology for verification and analysis, (22-36)
  40. ACM
    Reps T, Sagiv M and Loginov A (2010). Finite differencing of logical formulas for static analysis, ACM Transactions on Programming Languages and Systems, 32:6, (1-55), Online publication date: 1-Aug-2010.
  41. ACM
    Balakrishnan G and Reps T (2010). WYSINWYX, ACM Transactions on Programming Languages and Systems, 32:6, (1-84), Online publication date: 1-Aug-2010.
  42. Li J, Xie F, Ball T and Levin V Efficient reachability analysis of büchi pushdown systems for hardware/software co-verification Proceedings of the 22nd international conference on Computer Aided Verification, (339-353)
  43. Li J, Xie F, Ball T, Levin V and McGarvey C An automata-theoretic approach to hardware/software co-verification Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering, (248-262)
  44. Li J, Pilkington N, Xie F and Liu Q (2010). Embedded architecture description language, Journal of Systems and Software, 83:2, (235-252), Online publication date: 1-Feb-2010.
  45. Emerson E Meanings of model checking Concurrency, Compositionality, and Correctness, (237-249)
  46. Balaban I, Pnueli A and Zuck L Proving the refuted Concurrency, Compositionality, and Correctness, (221-236)
  47. Boker U and Kupferman O The quest for a tight translation of büchi to co-büchi automata Fields of logic and computation, (147-164)
  48. Kupferman O, Piterman N and Vardi M An automata-theoretic approach to infinite-state systems Time for verification, (202-259)
  49. Clarke E, Kurshan R and Veith H The localization reduction and counterexample-guided abstraction refinement Time for verification, (61-71)
  50. Liffiton M, Mneimneh M, Lynce I, Andraus Z, Marques-Silva J and Sakallah K (2009). A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas, Constraints, 14:4, (415-442), Online publication date: 1-Dec-2009.
  51. ACM
    Clarke E, Emerson E and Sifakis J (2009). Model checking, Communications of the ACM, 52:11, (74-84), Online publication date: 1-Nov-2009.
  52. ACM
    Jhala R and Majumdar R (2009). Software model checking, ACM Computing Surveys, 41:4, (1-54), Online publication date: 1-Oct-2009.
  53. Droste M and Rahonis G (2009). Weighted automata and weighted logics with discounting, Theoretical Computer Science, 410:37, (3481-3494), Online publication date: 1-Sep-2009.
  54. ACM
    Nanshi K and Somenzi F Constraints in one-to-many concretization for abstraction refinement Proceedings of the 46th Annual Design Automation Conference, (569-574)
  55. Cohen M, Dam M, Lomuscio A and Russo F Abstraction in model checking multi-agent systems Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (945-952)
  56. Kupferman O and Piterman N Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 5504, (182-196)
  57. Li B and Kwok C Automatic formal verification of clock domain crossing signals Proceedings of the 2009 Asia and South Pacific Design Automation Conference, (654-659)
  58. Hagen G and Tinelli C Scaling up the formal verification of Lustre programs with SMT-based techniques Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, (1-9)
  59. Calder M and Miller A (2008). An automatic abstraction technique for verifying featured, parameterised systems, Theoretical Computer Science, 404:3, (235-255), Online publication date: 1-Sep-2008.
  60. Ivančić F, Yang Z, Ganai M, Gupta A and Ashar P (2008). Efficient SAT-based bounded model checking for software verification, Theoretical Computer Science, 404:3, (256-274), Online publication date: 1-Sep-2008.
  61. Prieto-Linillos P, Gutiérrez S, Pardo A and Delgado Kloos C Guaranteeing the Correctness of an Adaptive Tutoring System Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems, (329-332)
  62. ACM
    He N and Hsiao M A new testability guided abstraction to solving bit-vector formula Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning, (39-45)
  63. Li J, Sun X, Xie F and Song X Component-Based Abstraction and Refinement Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems, (39-51)
  64. Chockler H, Grumberg O and Yadgar A Efficient automatic STE refinement using responsibility Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems, (233-248)
  65. ACM
    Nanshi K and Somenzi F Improved visibility in one-to-many trace concretization Proceedings of the conference on Design, automation and test in Europe, (819-824)
  66. ACM
    Lahiri S and Qadeer S (2008). Back to the future, ACM SIGPLAN Notices, 43:1, (171-182), Online publication date: 14-Jan-2008.
  67. ACM
    Lahiri S and Qadeer S Back to the future Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (171-182)
  68. Vardi M From monadic logic to PSL Pillars of computer science, (656-681)
  69. ACM
    Cabodi G, Murciano M, Nocco S and Quer S (2008). Boosting interpolation with dynamic localized abstraction and redundancy removal, ACM Transactions on Design Automation of Electronic Systems, 13:1, (1-20), Online publication date: 1-Jan-2008.
  70. ACM
    Shoham S and Grumberg O (2007). A game-based framework for CTL counterexamples and 3-valued abstraction-refinement, ACM Transactions on Computational Logic, 9:1, (1-es), Online publication date: 1-Dec-2007.
  71. Cook B, Kroening D and Sharygina N (2007). Verification of Boolean programs with unbounded thread creation, Theoretical Computer Science, 388:1-3, (227-242), Online publication date: 1-Dec-2007.
  72. Kroening D and Seshia S Formal verification at higher levels of abstraction Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, (572-578)
  73. Wang C, Kim H and Gupta A Hybrid CEGAR Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, (310-317)
  74. Gupta A From hardware verification to software verification Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing, (14-15)
  75. Dax C, Eisinger J and Klaedtke F Mechanizing the powerset construction for restricted classes of ω-automata Proceedings of the 5th international conference on Automated technology for verification and analysis, (223-236)
  76. Beyer D, Henzinger T, Jhala R and Majumdar R (2007). The software model checker Blast, International Journal on Software Tools for Technology Transfer (STTT), 9:5-6, (505-525), Online publication date: 1-Oct-2007.
  77. ACM
    D'Silva V, Sonalkar S and Ramesh S Existential abstractions for distributed reactive systems via syntactic transformations Proceedings of the 7th ACM & IEEE international conference on Embedded software, (240-248)
  78. Kupferman O Tightening the exchange rates between automata Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic, (7-22)
  79. Droste M and Gastin P (2007). Weighted automata and weighted logics, Theoretical Computer Science, 380:1-2, (69-86), Online publication date: 20-Jul-2007.
  80. Droste M and Rahonis G Weighted automata and weighted logics with discounting Proceedings of the 12th international conference on Implementation and application of automata, (73-84)
  81. Vardi M Linear-time model checking Proceedings of the 12th international conference on Implementation and application of automata, (5-10)
  82. Lüttgen G and Vogler W Ready simulation for concurrency Proceedings of the 34th international conference on Automata, Languages and Programming, (752-763)
  83. Wang C, Yang Z, Gupta A and Ivančic F Using counterexamples for improving the precision of reachability computation with polyhedra Proceedings of the 19th international conference on Computer aided verification, (352-365)
  84. Matsliah A and Strichman O Underapproximation for model-checking based on random cryptographic constructions Proceedings of the 19th international conference on Computer aided verification, (339-351)
  85. Bloem R, Cavada R, Pill I, Roveri M and Tchaltsev A RAT Proceedings of the 19th international conference on Computer aided verification, (263-267)
  86. Braghin C, Sharygina N and Barone-Adesi K Automated verification of security policies in mobile code Proceedings of the 6th international conference on Integrated formal methods, (37-53)
  87. Kroening D and Sharygina N Interactive presentation: Image computation and predicate refinement for RTL verilog using word level proofs Proceedings of the conference on Design, automation and test in Europe, (1325-1330)
  88. Jha S, Krogh B, Weimer J and Clarke E Reachability for linear hybrid automata using iterative relaxation abstraction Proceedings of the 10th international conference on Hybrid systems: computation and control, (287-300)
  89. Jain H, Kroening D, Sharygina N and Clarke E VCEGAR Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, (583-586)
  90. Sebastiani R, Tonetta S and Vardi M Property-driven partitioning for abstraction refinement Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, (389-404)
  91. Chaki S and Strichman O Optimized L*-based assume-guarantee reasoning Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, (276-291)
  92. ACM
    He F, Song X, Gu M and Sun J Effective heuristics for counterexample-guided abstraction refinement Proceedings of the 17th ACM Great Lakes symposium on VLSI, (393-398)
  93. Lüttgen G and Vogler W (2007). Conjunction on processes, Theoretical Computer Science, 373:1-2, (19-40), Online publication date: 10-Mar-2007.
  94. Vardi M The Büchi complementation saga Proceedings of the 24th annual conference on Theoretical aspects of computer science, (12-22)
  95. ACM
    Cook B, Gotsman A, Podelski A, Rybalchenko A and Vardi M Proving that programs eventually do something good Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (265-276)
  96. ACM
    Cook B, Gotsman A, Podelski A, Rybalchenko A and Vardi M (2007). Proving that programs eventually do something good, ACM SIGPLAN Notices, 42:1, (265-276), Online publication date: 17-Jan-2007.
  97. Ball T and Kupferman O Better under-approximation of programs by hiding variables Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation, (314-328)
  98. Kupferman O and Lustig Y Lattice automata Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation, (199-213)
  99. Vardi M Automata-theoretic model checking revisited Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation, (137-150)
  100. ACM
    Gulavani B, Henzinger T, Kannan Y, Nori A and Rajamani S SYNERGY Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, (117-127)
  101. Xie F, Yang G and Song X Compositional reasoning for hardware/software co-verification Proceedings of the 4th international conference on Automated Technology for Verification and Analysis, (154-169)
  102. Aminof B and Kupferman O On the succinctness of nondeterminism Proceedings of the 4th international conference on Automated Technology for Verification and Analysis, (125-140)
  103. ACM
    Ball T, Bounimova E, Cook B, Levin V, Lichtenberg J, McGarvey C, Ondrusek B, Rajamani S and Ustuner A (2006). Thorough static analysis of device drivers, ACM SIGOPS Operating Systems Review, 40:4, (73-85), Online publication date: 1-Oct-2006.
  104. ACM
    Miller A, Donaldson A and Calder M (2006). Symmetry in temporal logic model checking, ACM Computing Surveys, 38:3, (8-es), Online publication date: 30-Sep-2006.
  105. Beyer D, Henzinger T and Théoduloz G Lazy shape analysis Proceedings of the 18th international conference on Computer Aided Verification, (532-546)
  106. Tzoref R and Grumberg O Automatic refinement and vacuity detection for symbolic trajectory evaluation Proceedings of the 18th international conference on Computer Aided Verification, (190-204)
  107. Kroening D and Weissenbacher G Counterexamples with loops for predicate abstraction Proceedings of the 18th international conference on Computer Aided Verification, (152-165)
  108. Jain H, Ivančić F, Gupta A, Shlyakhter I and Wang C Using statically computed invariants inside the predicate abstraction and refinement loop Proceedings of the 18th international conference on Computer Aided Verification, (137-151)
  109. ACM
    Nanshi K and Somenzi F Guiding simulation with increasingly refined abstract traces Proceedings of the 43rd annual Design Automation Conference, (737-742)
  110. Yan Q Lower bounds for complementation of ω-automata via the full automata technique Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (589-600)
  111. Droste M and Rahonis G Weighted automata and weighted logics on infinite words Proceedings of the 10th international conference on Developments in Language Theory, (49-58)
  112. Gupta A, Ganai M and Wang C SAT-Based verification methods and applications in hardware verification Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems, (108-143)
  113. Cabodi G and Murciano M BDD-Based hardware verification Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems, (78-107)
  114. Yang G, Yang J, Song X and Xie F Maximal models of assertion graph in GSTE Proceedings of the Third international conference on Theory and Applications of Models of Computation, (684-693)
  115. ACM
    Ball T, Bounimova E, Cook B, Levin V, Lichtenberg J, McGarvey C, Ondrusek B, Rajamani S and Ustuner A Thorough static analysis of device drivers Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006, (73-85)
  116. Geldenhuys J and Hansen H Larger automata and less work for LTL model checking Proceedings of the 13th international conference on Model Checking Software, (53-70)
  117. Ghosh I and Prasad M A Technique for Estimating the Difficulty of a Formal Verification Problem Proceedings of the 7th International Symposium on Quality Electronic Design, (63-70)
  118. Gulavani B and Rajamani S Counterexample driven refinement for abstract interpretation Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (474-488)
  119. Chaki S, Clarke E, Kidd N, Reps T and Touili T Verifying concurrent message-passing c programs with recursive calls Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (334-349)
  120. Kroening D and Sharygina N Approximating predicate images for bit-vector logic Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (242-256)
  121. Li B and Somenzi F Efficient abstraction refinement in interpolation-based unbounded model checking Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (227-241)
  122. Lüttgen G and Vogler W Conjunction on processes Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures, (261-276)
  123. Andraus Z, Liffiton M and Sakallah K Refinement strategies for verification methods based on datapath abstraction Proceedings of the 2006 Asia and South Pacific Design Automation Conference, (19-24)
  124. Component-based hardware/software co-verification Proceedings of the Fourth ACM/IEEE International Conference on Formal Methods and Models for Co-Design, (27-36)
  125. Kroening D (2006). Computing Over-Approximations with Bounded Model Checking, Electronic Notes in Theoretical Computer Science (ENTCS), 144:1, (79-92), Online publication date: 1-Jan-2006.
  126. Chaki S, Clarke E, Grumberg O, Ouaknine J, Sharygina N, Touili T and Veith H State/Event software verification for branching-time specifications Proceedings of the 5th international conference on Integrated Formal Methods, (53-69)
  127. Kupferman O and Vardi M (2005). From complementation to certification, Theoretical Computer Science, 345:1, (83-100), Online publication date: 21-Nov-2005.
  128. Clarke E, Sharygina N and Sinha N Program compatibility approaches Proceedings of the 4th international conference on Formal Methods for Components and Objects, (243-258)
  129. Grumberg O Abstraction and refinement in model checking Proceedings of the 4th international conference on Formal Methods for Components and Objects, (219-242)
  130. Zhang L, Prasad M and Hsiao M Interleaved invariant checking with dynamic abstraction Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods, (81-96)
  131. Amla N, Du X, Kuehlmann A, Kurshan R and McMillan K An analysis of SAT-based model checking techniques in an industrial environment Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods, (254-268)
  132. Ward D and Somenzi F Automatic generation of hints for symbolic traversal Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods, (207-221)
  133. Paruthi V, Jacobi C and Weber K Efficient symbolic simulation via dynamic scheduling, don't caring, and case splitting Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods, (114-128)
  134. Gupta A and Clarke E Reconsidering CEGAR Proceedings of the 2005 International Conference on Computer Design, (591-598)
  135. Ivančić F, Shlyakhter I, Gupta A and Ganai M Model Checking C Programs Using F-SOFT Proceedings of the 2005 International Conference on Computer Design, (297-308)
  136. Droste M and Gastin P Weighted automata and weighted logics Proceedings of the 32nd international conference on Automata, Languages and Programming, (513-525)
  137. Alur R, Madhusudan P and Nam W Symbolic compositional verification by learning assumptions Proceedings of the 17th international conference on Computer Aided Verification, (548-562)
  138. Loginov A, Reps T and Sagiv M Abstraction refinement via inductive learning Proceedings of the 17th international conference on Computer Aided Verification, (519-533)
  139. Gupta A and Strichman O Abstraction refinement for bounded model checking Proceedings of the 17th international conference on Computer Aided Verification, (112-124)
  140. ACM
    Banerjee A and Dasgupta P (2005). The open family of temporal logics, ACM Transactions on Design Automation of Electronic Systems, 10:3, (492-522), Online publication date: 1-Jul-2005.
  141. ACM
    Zhang L, Prasad M, Hsiao M and Sidle T Dynamic abstraction using SAT-based BMC Proceedings of the 42nd annual Design Automation Conference, (754-757)
  142. ACM
    Jain H, Kroening D, Sharygina N and Clarke E Word level predicate abstraction and refinement for verifying RTL verilog Proceedings of the 42nd annual Design Automation Conference, (445-450)
  143. Bjesse P and Kukula J Automatic generalized phase abstraction for formal verification Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, (1076-1082)
  144. ACM
    Kupferman O and Vardi M (2005). From linear time to branching time, ACM Transactions on Computational Logic, 6:2, (273-294), Online publication date: 1-Apr-2005.
  145. Prasad M, Biere A and Gupta A (2005). A survey of recent advances in SAT-based formal verification, International Journal on Software Tools for Technology Transfer (STTT), 7:2, (156-173), Online publication date: 1-Apr-2005.
  146. Li B, Wang C and Somenzi F (2005). Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure, International Journal on Software Tools for Technology Transfer (STTT), 7:2, (143-155), Online publication date: 1-Apr-2005.
  147. Fehnker A, Clarke E, Jha S and Krogh B Refining abstractions of hybrid systems using counterexample fragments Proceedings of the 8th international conference on Hybrid Systems: computation and control, (242-257)
  148. Stoller S and Schneider F (2005). Automated Analysis of Fault-Tolerance in Distributed Systems, Formal Methods in System Design, 26:2, (183-196), Online publication date: 1-Mar-2005.
  149. La Torre S, Murano A and Napoli M (2005). Weak Muller acceptance conditions for tree automata, Theoretical Computer Science, 332:1-3, (233-250), Online publication date: 28-Feb-2005.
  150. Burckhardt S, Alur R and Martin M Verifying safety of a token coherence implementation by parametric compositional refinement Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation, (130-145)
  151. ACM
    Grumberg O, Lerda F, Strichman O and Theobald M (2005). Proof-guided underapproximation-widening for multi-process systems, ACM SIGPLAN Notices, 40:1, (122-131), Online publication date: 12-Jan-2005.
  152. ACM
    Grumberg O, Lerda F, Strichman O and Theobald M Proof-guided underapproximation-widening for multi-process systems Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (122-131)
  153. Vardi M Model checking for database theoreticians Proceedings of the 10th international conference on Database Theory, (1-16)
  154. Zhang Y, Wang D, Wang J and Zheng W Using model-based test program generator for simulation validation Proceedings of the First international conference on Embedded Software and Systems, (549-556)
  155. ACM
    Ferrara A Web services Proceedings of the 2nd international conference on Service oriented computing, (242-251)
  156. Li B and Somenzi F Efficient computation of small abstraction refinements Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, (518-525)
  157. Kroening D and Clarke E Checking consistency of C and Verilog using predicate abstraction and induction Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, (66-72)
  158. Bjesse P and Boralv A DAG-aware circuit compression for formal verification Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, (42-49)
  159. Cook B, Kroening D and Sharygina N Accurate theorem proving for program verification Proceedings of the First international conference on Leveraging Applications of Formal Methods, (96-114)
  160. La Torre S and Murano A Reasoning about Co-Büchi tree automata Proceedings of the First international conference on Theoretical Aspects of Computing, (527-542)
  161. Sharygina N, Browne J, Xie F, Kurshan R and Levin V (2004). Lessons Learned from Model Checking a NASA Robot Controller, Formal Methods in System Design, 25:2-3, (241-270), Online publication date: 1-Sep-2004.
  162. Chaki S, Clarke E, Groce A, Ouaknine J, Strichman O and Yorav K (2004). Efficient Verification of Sequential and Concurrent C Programs, Formal Methods in System Design, 25:2-3, (129-166), Online publication date: 1-Sep-2004.
  163. Clarke E, Kroening D, Sharygina N and Yorav K (2004). Predicate Abstraction of ANSI-C Programs Using SAT, Formal Methods in System Design, 25:2-3, (105-127), Online publication date: 1-Sep-2004.
  164. Núñez M, Rodríguez I and Rubio F A formal framework to reduce communications in communication systems Proceedings of the 4th international conference on Innovative Internet Community Systems, (69-80)
  165. ACM
    Mang F and Ho P Abstraction refinement by controllability and cooperativeness analysis Proceedings of the 41st annual Design Automation Conference, (224-229)
  166. Füredi Z and Kurshan R (2004). Minimal length test vectors for multiple-fault detection, Theoretical Computer Science, 315:1, (191-208), Online publication date: 5-May-2004.
  167. Bjesse P and Kukula J Using Counter Example Guided Abstraction Refinement to Find Complex Bugs Proceedings of the conference on Design, automation and test in Europe - Volume 1
  168. Baumgartner J and Kuehlmann A Enhanced Diameter Bounding via Structural Proceedings of the conference on Design, automation and test in Europe - Volume 1
  169. Wedler M, Stoffel D and Kunz W Exploiting state encoding for invariant generation in induction-based property checking Proceedings of the 2004 Asia and South Pacific Design Automation Conference, (424-429)
  170. Automated, compositional and iterative deadlock detection Proceedings of the Second ACM/IEEE International Conference on Formal Methods and Models for Co-Design, (201-210)
  171. Verification of SpecC using predicate abstraction Proceedings of the Second ACM/IEEE International Conference on Formal Methods and Models for Co-Design, (7-16)
  172. Gupta A, Ganai M, Yang Z and Ashar P Iterative Abstraction using SAT-based BMC with Proof Analysis Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  173. Wang C, Li B, Jin H, Hachtel G and Somenzi F Improving Ariadne's Bundle by Following Multiple Threads in Abstraction Refinement Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  174. Hu A, Casas J and Yang J Efficient Generation of Monitor Circuits for GSTE Assertion Graphs Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
  175. Harel D, Kugler H and Weiss G Some methodological observations resulting from experience using LSCs and the play-in/play-out approach Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools, (26-42)
  176. ACM
    Xie F and Browne J (2003). Verified systems by composition from verified components, ACM SIGSOFT Software Engineering Notes, 28:5, (277-286), Online publication date: 1-Sep-2003.
  177. ACM
    Xie F and Browne J Verified systems by composition from verified components Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, (277-286)
  178. Vardi M Automated verification Proceedings of the 18th international joint conference on Artificial intelligence, (1603-1606)
  179. Peled D Model checking and testing combined Proceedings of the 30th international conference on Automata, languages and programming, (47-63)
  180. Latvala T Efficient model checking of safety properties Proceedings of the 10th international conference on Model checking software, (74-88)
  181. ACM
    Wang F and Tahar S Language emptiness checking using MDGs Proceedings of the 13th ACM Great Lakes symposium on VLSI, (88-91)
  182. Clarke E, Fehnker A, Han Z, Krogh B, Stursberg O and Theobald M Verification of hybrid systems based on counterexample-guided abstraction refinement Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (192-207)
  183. Glusman M, Kamhi G, Mador-Haim S, Fraer R and Vardi M Multiple-counterexample guided iterative abstraction refinement Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (176-191)
  184. Amla N, Kurshan R, McMillan K and Medel R Experimental analysis of different techniques for bounded model checking Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (34-48)
  185. McMillan K and Amla N Automatic abstraction without counterexamples Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems, (2-17)
  186. Sharygina N and Browne J Model checking software via abstraction of loop transitions Proceedings of the 6th international conference on Fundamental approaches to software engineering, (325-340)
  187. Ben-David S, Eisner C, Geist D and Wolfsthal Y (2003). Model Checking at IBM, Formal Methods in System Design, 22:2, (101-108), Online publication date: 1-Mar-2003.
  188. McMillan K Model checking Encyclopedia of Computer Science, (1177-1181)
  189. Kurshan R, Levin V, Minea M, Peled D and Yenigün H (2002). Combining Software and Hardware Verification Techniques, Formal Methods in System Design, 21:3, (251-280), Online publication date: 1-Nov-2002.
  190. Cau A, Hale R, Dimitrov J, Zedan H, Moszkowski B, Manjunathaiah M and Spivey M (2002). A Compositional Framework for Hardware/Software Co-Design, Design Automation for Embedded Systems, 6:4, (367-399), Online publication date: 1-Jul-2002.
  191. Fisler K and Vardi M (2002). Bisimulation Minimization and Symbolic Model Checking, Formal Methods in System Design, 21:1, (39-78), Online publication date: 1-Jul-2002.
  192. Shute M (2002). SPPV, Journal of Computing Sciences in Colleges, 17:6, (292-294), Online publication date: 1-May-2002.
  193. Nalumasu R and Gopalakrishnan G (2002). An Efficient Partial Order Reduction Algorithm with an Alternative Proviso Implementation, Formal Methods in System Design, 20:3, (231-247), Online publication date: 1-May-2002.
  194. Harel D, Kupferman O and Vardi M (2002). On the complexity of verifying concurrent transition systems, Information and Computation, 173:2, (143-161), Online publication date: 15-Mar-2002.
  195. ACM
    Ball T and Rajamani S The SLAM project Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (1-3)
  196. Gupta A, Casavant A, Ashar P, Mukaiyama A, Wakabayashi K and Liu X Property-Specific Testbench Generation for Guided Simulation Proceedings of the 2002 Asia and South Pacific Design Automation Conference
  197. ACM
    Ball T and Rajamani S (2002). The SLAM project, ACM SIGPLAN Notices, 37:1, (1-3), Online publication date: 1-Jan-2002.
  198. ACM
    Gottlob G, Grädel E and Veith H (2002). Datalog LITE, ACM Transactions on Computational Logic, 3:1, (42-79), Online publication date: 1-Jan-2002.
  199. Balarin F STARS in VCC Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (471-478)
  200. Peled D, Vardi M and Yannakakis M (2001). Black box checking, Journal of Automata, Languages and Combinatorics, 7:2, (225-246), Online publication date: 1-Nov-2001.
  201. Chebotarev A (2001). The Automata-Theoretic Approach to Verification of Reactive Systems, Cybernetics and Systems Analysis, 37:6, (810-819), Online publication date: 1-Nov-2001.
  202. ACM
    Sekar R, Ramakrishnan C, Ramakrishnan I and Smolka S Model-Carrying Code (MCC) Proceedings of the 2001 workshop on New security paradigms, (23-30)
  203. ACM
    St. James S and Ultes-Nitsche U Computing property-preserving behaviour abstractions from trace reductions Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, (238-245)
  204. Chechik M and Gannon J (2001). Automatic Analysis of Consistency between Requirements and Designs, IEEE Transactions on Software Engineering, 27:7, (651-672), Online publication date: 1-Jul-2001.
  205. Clarke E, Biere A, Raimi R and Zhu Y (2001). Bounded Model Checking Using Satisfiability Solving, Formal Methods in System Design, 19:1, (7-34), Online publication date: 1-Jul-2001.
  206. ACM
    Wang D, Jiang P, Kukula J, Zhu Y, Ma T and Damiano R Formal property verification by abstraction refinement with formal, simulation and hybrid engines Proceedings of the 38th annual Design Automation Conference, (35-40)
  207. Edwards S, Lavagno L, Lee E and Sangiovanni-Vincentelli A Design of embedded systems Readings in hardware/software co-design, (86-107)
  208. Jia G and Graf S Verification experiments on the MASCARA protocol Proceedings of the 8th international SPIN workshop on Model checking of software, (123-142)
  209. Ball T and Rajamani S Automatically validating temporal safety properties of interfaces Proceedings of the 8th international SPIN workshop on Model checking of software, (103-122)
  210. Peled D and Zuck L From model checking to a temporal proof Proceedings of the 8th international SPIN workshop on Model checking of software, (1-14)
  211. Hardin R, Kurshan R, Shukla S and Vardi M (2001). A New Heuristic for Bad Cycle Detection Using BDDs, Formal Methods in System Design, 18:2, (131-140), Online publication date: 1-Mar-2001.
  212. Clarke E and Schlingloff B Model checking Handbook of automated reasoning, (1635-1790)
  213. Gottlob G, Grädel E and Veith H Linear time datalog and branching time logic Logic-based artificial intelligence, (443-467)
  214. Cuatto T, Passerone C, Sansoè C, Gregoretti F, Jurecska A and Sangiovanni-Vincentelli A (2000). A Case Study in Embedded Systems Design, Design Automation for Embedded Systems, 6:1, (71-88), Online publication date: 1-Sep-2000.
  215. ACM
    Aagaard M, Jones R, Kaivola R, Kohatsu K and Seger C Formal verification of iterative algorithms in microprocessors Proceedings of the 37th Annual Design Automation Conference, (201-206)
  216. ACM
    Yang J and Tiemeyer A Lazy symbolic model checking Proceedings of the 37th Annual Design Automation Conference, (35-38)
  217. ACM
    Bloem R, Ravi K and Somenzi F Symbolic guided search for CTL model checking Proceedings of the 37th Annual Design Automation Conference, (29-34)
  218. ACM
    Moon I, Kukula J, Ravi K and Somenzi F To split or to conjoin Proceedings of the 37th Annual Design Automation Conference, (23-28)
  219. Bjørner N, Browne A, Colón M, Finkbeiner B, Manna Z, Sipma H and Uribe T (2000). Verifying Temporal Properties of Reactive Systems, Formal Methods in System Design, 16:3, (227-270), Online publication date: 1-Jun-2000.
  220. ACM
    Lajolo M, Lavagno L, Rebaudengo M, Reorda M and Violante M Automatic test bench generation for simulation-based validation Proceedings of the eighth international workshop on Hardware/software codesign, (136-140)
  221. ACM
    Jang J, Moon I and Hachtel G Iterative abstraction-based CTL model checking Proceedings of the conference on Design, automation and test in Europe, (502-509)
  222. Balarin F Worst-case analysis of discrete systems Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, (347-353)
  223. Kurshan R, Merritt M, Orda A and Sachs S (1999). Modelling Asynchrony with a Synchronous Model, Formal Methods in System Design, 15:3, (175-199), Online publication date: 1-Nov-1999.
  224. Gyuris V and Sistla A (1999). On-the-Fly Model Checking Under Fairness that Exploits Symmetry, Formal Methods in System Design, 15:3, (217-238), Online publication date: 1-Nov-1999.
  225. Chou C and Peled D (1999). Formal Verification of a Partial-Order Reduction Technique for Model Checking, Journal of Automated Reasoning, 23:3, (265-298), Online publication date: 1-Nov-1999.
  226. Sekar R and Uppuluri P Synthesizing fast intrusion prevention/detection systems from high-level specifications Proceedings of the 8th conference on USENIX Security Symposium - Volume 8, (6-6)
  227. Alur R and Henzinger T (1999). Reactive Modules, Formal Methods in System Design, 15:1, (7-48), Online publication date: 1-Jul-1999.
  228. Fisler K (1999). Timing Diagrams, Journal of Logic, Language and Information, 8:3, (323-361), Online publication date: 1-Jul-1999.
  229. Thaker P, Agrawal V and Zaghloul M Validation Vector Grade (VVG) Proceedings of the 1999 17TH IEEE VLSI Test Symposium
  230. Kupferman O and Vardi M The weakness of self-complementation Proceedings of the 16th annual conference on Theoretical aspects of computer science, (455-466)
  231. Bharadwaj R and Heitmeyer C (1999). Model Checking Complete Requirements Specifications Using Abstraction, Automated Software Engineering, 6:1, (37-68), Online publication date: 1-Jan-1999.
  232. Heitmeyer C, Kirby J, Labaw B, Archer M and Bharadwaj R (1998). Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications, IEEE Transactions on Software Engineering, 24:11, (927-948), Online publication date: 1-Nov-1998.
  233. Mikk E, Lakhnech Y, Siegel M and Holzmann G Implementing Statecharts in PROMELA/SPIN Proceedings of the Second IEEE Workshop on Industrial Strength Formal Specification Techniques
  234. ACM
    Kupferman O and Vardi M Weak alternating automata and tree automata emptiness Proceedings of the thirtieth annual ACM symposium on Theory of computing, (224-233)
  235. ACM
    Pardo A and Hachtel G Incremental CTL model checking using BDD subsetting Proceedings of the 35th annual Design Automation Conference, (457-462)
  236. ACM
    Ravi K, McMillan K, Shiple T and Somenzi F Approximation and decomposition of binary decision diagrams Proceedings of the 35th annual Design Automation Conference, (445-450)
  237. ACM
    Petersen J Automatic verification of railway interlocking systems Proceedings of the second workshop on Formal methods in software practice, (1-6)
  238. ACM
    Chan W, Anderson R, Beame P and Notkin D (1998). Improving efficiency of symbolic model checking for state-based system requirements, ACM SIGSOFT Software Engineering Notes, 23:2, (102-112), Online publication date: 1-Mar-1998.
  239. ACM
    Chan W, Anderson R, Beame P and Notkin D Improving efficiency of symbolic model checking for state-based system requirements Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis, (102-112)
  240. Hsieh Y and Levitan S Model abstraction for formal verification Proceedings of the conference on Design, automation and test in Europe, (140-147)
  241. Kurshan R, Levin V, Minea M, Peled D and Yenigün H Verifying hardware in its software context Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, (742-749)
  242. ACM
    Kurshan R Formal verification in a commercial setting Proceedings of the 34th annual Design Automation Conference, (258-262)
  243. ACM
    Meinel C, Somenzi F and Theobald T Linear sifting of decision diagrams Proceedings of the 34th annual Design Automation Conference, (202-207)
  244. ACM
    Nelson K, Jain A and Bryant R Formal verification of a superscalar execution unit Proceedings of the 34th annual Design Automation Conference, (161-166)
  245. ACM
    Alur R, Jagadeesan L, Kott J and Von Olnhausen J Model-checking of real-time systems Proceedings of the 19th international conference on Software engineering, (514-524)
  246. Holzmann G (1997). The Model Checker SPIN, IEEE Transactions on Software Engineering, 23:5, (279-295), Online publication date: 1-May-1997.
  247. Lee D, Ramakrishnan K, Moh W and Shankar A Performance and Correctness of the ATM ABR Rate Control Scheme Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
  248. Merritt M, Orda A and Sachs S (1997). Formal Verification of a Distributed Computer System, Formal Methods in System Design, 10:1, (93-125), Online publication date: 1-Feb-1997.
  249. Rajan S, Shankar N and Srivas M Industrial Strength Formal Verification Techniques for Hardware Designs Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
  250. Alur R and Henzinger T Reactive Modules Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  251. Kupferman O, Safra S and Vardi M Relating word and tree automata Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  252. ACM
    Neumann P (1996). Using formal methods to reduce risks, Communications of the ACM, 39:7, (114), Online publication date: 1-Jul-1996.
  253. ACM
    Eiríksson Á Integrating formal verification methods with a conventional project design flow Proceedings of the 33rd annual Design Automation Conference, (666-671)
  254. ACM
    Balarin F, Hsieh H, Jurecska A, Lavagno L and Sangiovanni-Vincentelli A Formal verification of embedded systems based on CFSM networks Proceedings of the 33rd annual Design Automation Conference, (568-571)
  255. ACM
    Jones K and Privitera J The automatic generation of functional test vectors for Rambus designs Proceedings of the 33rd annual Design Automation Conference, (415-420)
  256. ACM
    Sangiovanni-Vincentelli A, McGeer P and Saldanha A Verification of electronic systems Proceedings of the 33rd annual Design Automation Conference, (106-111)
  257. ACM
    Klarlund N, Nielsen M and Sunesen K Automated logical verification based on trace abstractions Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, (101-110)
  258. ACM
    Jackson D, Jha S and Damon C Faster checking of software specifications by eliminating isomorphs Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (79-90)
  259. Bright J Checking the Integrity of Trees Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
  260. ACM
    Alur R, Courcoubetis C and Yannakakis M Distinguishing tests for nondeterministic and probabilistic machines Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (363-372)
  261. ACM
    McMillan K Fitting formal methods into the design cycle Proceedings of the 31st annual Design Automation Conference, (314-319)
  262. ACM
    Kurshan R The complexity of verification Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (365-371)
  263. Fan K, Yang M and Huang C Automatic abstraction refinement of TR for PDR 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC), (121-126)
Contributors
  • Cadence Design Systems

Index Terms

  1. Computer-aided verification of coordinating processes: the automata-theoretic approach

        Recommendations

        Reviews

        Simon John Thompson

        Verification is the process of showing that a system meets aspects of its specification by means of logical reasoning. As the author states, the field ranges from pencil-and-paper proof, through machine-assisted verification in which substantial amounts of bookkeeping and checking are automated, to fully automatic verification. General logical validity is undecidable, forcing some degree of human intervention, but many subproblems are decidable, which allows for machine implementation of the verification problem. In the introduction, the author provides a useful survey of techniques in this area, including model checking and binary decision diagrams. His approach is one of automata-theoretic verification, in which it is shown that the behaviors of an implementation all meet the constraints of the specifi cation, which is itself expressed as an automaton. The system uses omega-automata, whose infinite behaviors are capable of describing liveness as well as invariant properties, permitting the verification of substantial practical constraints. In order to make verification tractable as well as decidable, limited formalisms are often used. The author's approach is different, and accords with common sense. He seeks to reduce the verification problem to a collection of simpler tasks, by a two-stage process. First a property is decomposed into a collection of local properties, then the localization of the full problem to each of these local properties replaces the original test by a computationally more tractable one. Of course, it is in the selection of the decomposition that the difficulty lies; the author offers various heuristics, but also says that “the general problem of how best to decompose a task into more local subtasks is an important open problem.” Nevertheless, this work offers substantial insight into the verification process. The author presents introductions to the theory of omega-automata as well as B oolean algebra before embarking on the main topics, making the book a self-contained introduction for anyone familiar with the fundamentals of the theory of machines. The book is well indexed and contains a substantial bibliography, as well as pointing to the implementation of the verification techniques in the COSPAN system.

        Access critical reviews of Computing literature here

        Become a reviewer for Computing Reviews.