Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Boigelot B, Fontaine P and Vergain B. Universal First-Order Quantification over Automata. Implementation and Application of Automata. (91-102).

    https://doi.org/10.1007/978-3-031-40247-0_6

  • Boigelot B, Fontaine P and Vergain B. Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates. Automated Deduction – CADE 29. (542-559).

    https://doi.org/10.1007/978-3-031-38499-8_31

  • Voigt M. (2021). Decidable First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates. Journal of Automated Reasoning. 65:3. (357-423). Online publication date: 1-Mar-2021.

    https://doi.org/10.1007/s10817-020-09567-8

  • Badihi S, Akinotcho F, Li Y and Rubin J. ARDiff: scaling program equivalence checking via iterative abstraction and refinement of common code. Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. (13-24).

    https://doi.org/10.1145/3368089.3409757

  • Gao C, Chen T and Wu Z. Separation Logic with Linearly Compositional Inductive Predicates and Set Data Constraints. SOFSEM 2019: Theory and Practice of Computer Science. (206-220).

    https://doi.org/10.1007/978-3-030-10801-4_17

  • Alberti F, Ghilardi S and Pagani E. (2017). Cardinality constraints for arrays (decidability results and applications). Formal Methods in System Design. 51:3. (545-574). Online publication date: 1-Dec-2017.

    https://doi.org/10.1007/s10703-017-0279-6

  • Speranski S. (2017). Notes on the Computational Aspects of Kripke's Theory of Truth. Studia Logica. 105:2. (407-429). Online publication date: 1-Apr-2017.

    https://doi.org/10.1007/s11225-016-9694-8

  • Alberti F, Ghilardi S and Pagani E. Counting Constraints in Flat Array Fragments. Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706. (65-81).

    https://doi.org/10.1007/978-3-319-40229-1_6

  • Alberti F, Ghilardi S and Sharygina N. A New Acceleration-Based Combination Framework for Array Properties. Proceedings of the 10th International Symposium on Frontiers of Combining Systems - Volume 9322. (169-185).

    https://doi.org/10.1007/978-3-319-24246-0_11

  • Backeman P and Rümmer P. Free Variables and Theories. Proceedings of the 10th International Symposium on Frontiers of Combining Systems - Volume 9322. (3-13).

    https://doi.org/10.1007/978-3-319-24246-0_1

  • Alberti F, Ghilardi S and Sharygina N. (2015). Decision Procedures for Flat Array Properties. Journal of Automated Reasoning. 54:4. (327-352). Online publication date: 1-Apr-2015.

    https://doi.org/10.1007/s10817-015-9323-7

  • Tan T. (2014). Extending two-variable logic on data trees with order on data values and its automata. ACM Transactions on Computational Logic. 15:1. (1-39). Online publication date: 1-Feb-2014.

    https://doi.org/10.1145/2559945

  • Speranski S. (2013). A note on definability in fragments of arithmetic with free unary predicates. Archive for Mathematical Logic. 52:5-6. (507-516). Online publication date: 1-Aug-2013.

    https://doi.org/10.1007/s00153-013-0328-9

  • Cantenot J, Ambert F and Bouquet F. Transformation rules from UML4MBT meta-model to SMT meta-model for model animation. Proceedings of the 12th Workshop on OCL and Textual Modelling. (55-60).

    https://doi.org/10.1145/2428516.2428526

  • Tan T. An Automata Model for Trees with Ordered Data Values. Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science. (586-595).

    https://doi.org/10.1109/LICS.2012.69

  • Sutcliffe G, Schulz S, Claessen K and Baumgartner P. The TPTP typed first-order form with arithmetic. Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning. (406-419).

    https://doi.org/10.1007/978-3-642-28717-6_32

  • Rümmer P. E-Matching with free variables. Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning. (359-374).

    https://doi.org/10.1007/978-3-642-28717-6_28

  • Fietzke A, Kruglov E and Weidenbach C. Automatic generation of invariants for circular derivations in SUP(LA). Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning. (197-211).

    https://doi.org/10.1007/978-3-642-28717-6_17

  • Bonacina M, Lynch C and Moura L. (2011). On Deciding Satisfiability by Theorem Proving with Speculative Inferences. Journal of Automated Reasoning. 47:2. (161-189). Online publication date: 1-Aug-2011.

    https://doi.org/10.1007/s10817-010-9213-y

  • Brillout A, Kroening D, Rümmer P and Wahl T. Beyond quantifier-free interpolation in extensions of Presburger arithmetic. Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation. (88-102).

    /doi/10.5555/1946284.1946292

  • Zhou M, He F, Wang B and Gu M. On array theory of bounded elements. Proceedings of the 22nd international conference on Computer Aided Verification. (570-584).

    https://doi.org/10.1007/978-3-642-14295-6_50

  • Veanes M and Bjørner N. Symbolic bounded conformance checking of model programs. Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics. (388-400).

    https://doi.org/10.1007/978-3-642-11486-1_33

  • Eisinger J and Klaedtke F. (2008). Don't care words with an application to the automata-based approach for real addition. Formal Methods in System Design. 33:1-3. (85-115). Online publication date: 1-Dec-2008.

    https://doi.org/10.1007/s10703-008-0057-6

  • Slissenko A. Verification in predicate logic with time. Proceedings of the 19th international conference on Computer Science Logic. (3-17).

    https://doi.org/10.1007/11538363_2

  • Dantchev S and Valencia F. On the computational limits of infinite satisfaction. Proceedings of the 2005 ACM symposium on Applied computing. (393-397).

    https://doi.org/10.1145/1066677.1066768

  • Fontaine P and Gribomont E. Decidability of invariant validation for paramaterized systems. Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems. (97-112).

    /doi/10.5555/1765871.1765883

  • Marcus L. (1996). SYNTACTIC AND SEMANTIC DEPENDENCE OF ARRAY-ARITHMETIC SENTENCES, WITH AN APPLICATION TO PROGRAM VERIFICATION. Fundamenta Informaticae. 27:1. (77-100). Online publication date: 1-Jan-1996.

    /doi/10.5555/2379549.2379554

  • Abadi M and Halpern J. (1994). Decidability and Expressiveness for First-Order Logics of Probability. Information and Computation. 112:1. (1-36). Online publication date: 1-Jul-1994.

    https://doi.org/10.1006/inco.1994.1049