Collections, Cardinalities, and Relations
暂无分享,去创建一个
[1] Robert Givan,et al. Tarskian Set Constraints , 2002, Inf. Comput..
[2] Ju. V. Matijasevic,et al. ENUMERABLE SETS ARE DIOPHANTINE , 2003 .
[3] J. Venn,et al. . On the diagrammatic and mechanical representation of propositions and reasonings , 2022 .
[4] Jan Vitek,et al. ECOOP 2008 - Object-Oriented Programming, 22nd European Conference, Paphos, Cyprus, July 7-11, 2008, Proceedings , 2008, ECOOP.
[5] Anindya Banerjee,et al. Regional Logic for Local Reasoning about Global Invariants , 2008, ECOOP.
[6] Edmond Schonberg,et al. Programming by Refinement, as Exemplified by the SETL Representation Sublanguage , 1979, TOPL.
[7] Viktor Kuncak,et al. Field Constraint Analysis , 2005, VMCAI.
[8] Harry R. Lewis,et al. Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..
[9] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.
[10] Mark A. Hillebrand,et al. VCC: A Practical System for Verifying Concurrent C , 2009, TPHOLs.
[11] Saharon Shelah,et al. Spectra of monadic second-order formulas with one unary function , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..
[12] Ruzica Piskac,et al. Decision Procedures for Multisets with Cardinality Constraints , 2008, VMCAI.
[13] Ian Pratt-Hartmann. Complexity of the Two-Variable Fragment with Counting Quantifiers , 2005, J. Log. Lang. Inf..
[14] Leszek Pacholski,et al. Complexity Results for First-Order Two-Variable Logic with Counting , 2000, SIAM J. Comput..
[15] Ruzica Piskac,et al. Linear Arithmetic with Stars , 2008, CAV.
[16] Thomas A. Henzinger,et al. The software model checker Blast , 2007, International Journal on Software Tools for Technology Transfer.
[17] S. Feferman,et al. The first order properties of products of algebraic systems , 1959 .
[18] Viktor Kuncak,et al. Full functional verification of linked data structures , 2008, PLDI '08.
[19] Diego Calvanese,et al. The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.
[20] Viktor Kuncak,et al. Decision Procedures for Set-Valued Fields , 2005, Electron. Notes Theor. Comput. Sci..
[21] Viktor Kuncak,et al. Modular Pluggable Analyses for Data Structure Consistency , 2006, IEEE Transactions on Software Engineering.
[22] Kousha Etessami,et al. Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.
[23] K. Rustan M. Leino,et al. Weakest-precondition of unstructured programs , 2005, PASTE '05.
[24] Viktor Kuncak,et al. Deciding Boolean Algebra with Presburger Arithmetic , 2006, Journal of Automated Reasoning.
[25] Friedrich Eisenbrand,et al. Carathéodory bounds for integer cones , 2006, Oper. Res. Lett..
[26] Viktor Kuncak,et al. Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic , 2007, CADE.
[27] Atul Singh,et al. Cardinality Abstraction for Declarative Networking Applications , 2009, CAV.
[28] Sumit Gulwani,et al. A combination framework for tracking partition sizes , 2009, POPL '09.
[29] Frank Pfenning,et al. Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings , 2007, CADE.
[30] Thomas A. Henzinger,et al. The software model checker B last : Applications to software engineering , 2007 .
[31] Thomas W. Reps,et al. Symbolic Implementation of the Best Transformer , 2004, VMCAI.
[32] Jana Koehler,et al. Modal Logics, Description Logics and Arithmetic Reasoning , 1999, Artif. Intell..
[33] Ruzica Piskac,et al. Combining Theories with Shared Set Operations , 2009, FroCoS.