Decidable fragments of many-sorted logic
暂无分享,去创建一个
[1] Michael Mortimer,et al. On languages with two variables , 1975, Math. Log. Q..
[2] J. Michael Spivey,et al. The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.
[3] Armin Biere,et al. Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..
[4] Daniel Jackson,et al. Micromodels of software: lightweight modelling and analysis with Alloy , 2002 .
[5] Warren D. Goldfarb. The Unsolvability of the Godel Class with Identity , 1984, J. Symb. Log..
[6] Neil Immerman,et al. The Boundary Between Decidability and Undecidability for Transitive-Closure Logics , 2004, CSL.
[7] Danièle Beauquier,et al. A first order logic for specification of timed algorithms: basic properties and a decidable class , 2001, Ann. Pure Appl. Log..
[8] Alexander Moshe Rabinovich,et al. Decidable Fragments of Many-Sorted Logic , 2007, LPAR.
[9] Lee Momtahan. Towards a Small Model Theorem for Data Independent Systems in Alloy , 2005, Electron. Notes Theor. Comput. Sci..
[10] Christoph Weidenbach,et al. SPASS & FLOTTER Version 0.42 , 1996, CADE.
[11] Andrei Voronkov,et al. The design and implementation of VAMPIRE , 2002, AI Commun..
[12] Danièle Beauquier,et al. Decidable verification for reducible timed automata specified in a first order logic with time , 2002, Theor. Comput. Sci..
[13] Danièle Beauquier,et al. Verification of Timed Algorithms: Gurevich Abstract State Machines versus First Order Timed Logic , 2000 .
[14] Neil Immerman,et al. Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures , 2005, CADE.
[15] Shuvendu K. Lahiri,et al. Back to the future: revisiting precise program verification using SMT solvers , 2008, POPL '08.
[16] George Boolos,et al. Computability and logic , 1974 .
[17] Daniel Jackson,et al. Alloy: a lightweight object modelling notation , 2002, TSEM.
[18] Yuri Gurevich,et al. The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.