Rewriting modulo SMT and open system analysis
Authors:
- Camilo RochaCRCamilo Rocha
- José MeseguerJMJosé Meseguer
- César MuñozCMCésar Muñoz
- 1 January 2017
- journal article
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 86 (1) , 269-297
Abstract
No abstract availableFunding Information
- National Science Foundation (CNS 13-19109)
- Langley Research Center (NNL09AA00A)
This publication has 24 references indexed in Scilit:
- Operational Termination of Membership Equational Programs: the Order-Sorted WayElectronic Notes in Theoretical Computer Science, 2009
- Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data StructuresElectronic Notes in Theoretical Computer Science, 2009
- Complete symbolic reachability analysis using back-and-forth narrowingTheoretical Computer Science, 2006
- Solving SAT and SAT Modulo TheoriesJournal of the ACM, 2006
- Semantic foundations for generalized rewrite theoriesTheoretical Computer Science, 2006
- Equational rules for rewriting logicTheoretical Computer Science, 2002
- KRONOS: a verification tool for real-time systemsInternational Journal on Software Tools for Technology Transfer, 1997
- A theory of timed automataTheoretical Computer Science, 1994
- Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operationsTheoretical Computer Science, 1992
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979