Beatriz Alarcon
Raul Gutierrez
Jose Iborra
Salvador Lucas
2007
Proving Termination of Context-Sensitive Rewriting with MU-TERM
ENTCS
188
105 – 115
10.1016/j.entcs.2007.05.041
Martin Avanzini
Christian Sternagel
René Thiemann
2015
Certification of Complexity Proofs using CeTA
RTA
LIPIcs
36
23–39
10.4230/LIPIcs.RTA.2015.23
http://drops.dagstuhl.de/opus/volltexte/2015/5187
Josh Berdine
Aziem Chawdhary
Byron Cook
Dino Distefano
Peter O'Hearn
2007
Variance Analyses from Invariance Analyses
POPL
211–224
10.1145/1190216.1190249
Denis Bogdănaş
Grigore Roşu
2015
K-Java: A Complete Semantics of Java
POPL
445–456
10.1145/2676726.2676982
Marc Brockschmidt
Byron Cook
Carsten Fuhs
2013
Better Termination Proving through Cooperation
CAV
413–429
10.1007/978-3-642-39799-8_28
Marc Brockschmidt
Byron Cook
Samin Ishtiaq
Heidy Khlaaf
Nir Piterman
2016
T2: Temporal Property Verification
TACAS
387–393
10.1007/978-3-662-49674-9_22
Qinxiang Cao
Lennart Beringer
Samuel Gruetter
Josiah Dodds
Andrew W. Appel
2018
VST-Floyd: A Separation Logic Tool to Verify Correctness of C Programs
JAR
10.1007/s10817-018-9457-5
Ştefan Ciobâcă
Dorel Lucanu
2018
A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems
IJCAR
295–311
10.1007/978-3-319-94205-6_20
Ştefan Ciobâcă
2014
Reducing Partial Equivalence to Partial Correctness
SYNASC
164–171
10.1109/SYNASC.2014.30
Ştefan Ciobâcă
Dorel Lucanu
2016
RMT: Proving Reachability Properties in Constrained Term Rewriting Systems Modulo Theories
Technical Report
TR 16-01
Alexandru Ioan Cuza University, Faculty of Computer Science
Evelyne Contejean
Pierre Courtieu
Julien Forest
Olivier Pons
Xavier Urbain
2007
Certification of Automated Termination Proofs
FroCoS
148–162
10.1007/978-3-540-74621-8_10
Byron Cook
Andreas Podelski
Andrey Rybalchenko
2006
Termination Proofs for Systems Code
PLDI
415–426
10.1145/1133981.1134029
Byron Cook
Abigail See
Florian Zuleger
2013
Ramsey vs. Lexicographic Termination Proving
TACAS
47–61
10.1007/978-3-642-36742-7_4
Andrei Ştefănescu
Ştefan Ciobâcă
Radu Mereuţă
Brandon M. Moore
Traian Florin Şerbănuţă
Grigore Roşu
2014
All-Path Reachability Logic
RTA-TLCA
425–440
10.1007/978-3-319-08918-8_29
Andrei Ştefănescu
Daejun Park
Shijiao Yuwen
Yilong Li
Grigore Roşu
2016
Semantics-Based Program Verifiers for All Languages
OOPSLA
74–91
10.1145/2983990.2984027
Chucky Ellison
Grigore Roşu
2012
An Executable Formal Semantics of C with Applications
POPL
533–544
10.1145/2103656.2103719
Jürgen Giesl
Cornelius Aschermann
Marc Brockschmidt
Fabian Emmes
Florian Frohn
Carsten Fuhs
Jera Hensel
Carsten Otto
Martin Plücker
Peter Schneider-Kamp
Thomas Ströder
Stephanie Swiderski
René Thiemann
2017
Analyzing Program Termination and Complexity Automatically with AProVE
JAR
58
1
3–31
10.1007/s10817-016-9388-y
Dorel Lucanu
Vlad Rusu
Andrei Arusoaie
2017
A generic framework for symbolic execution: a coinductive approach
J. Symb. Comput.
80
125–163
10.1016/j.jsc.2016.07.012
Pedro da Rocha Pinto
Thomas Dinsdale-Young
Philippa Gardner
Julian Sutherland
2016
Modular Termination Verification for Non-Blocking Concurrency
ESOP
176–201
10.1007/978-3-662-49498-1_8
Grigore Roşu
Andrei Ştefănescu
2012
Checking Reachability using Matching Logic
OOPSLA
555–574
10.1145/2384616.2384656
Grigore Roşu
Andrei Ştefănescu
Ştefan Ciobâcă
Brandon M. Moore
2013
One-Path Reachability Logic
LICS
358–367
10.1109/LICS.2013.42
Grigore Roşu
Chucky Ellison
Wolfram Schulte
2010
Matching Logic: An Alternative to Hoare/Floyd Logic
AMAST
LNCS
6486
142–162
10.1007/978-3-642-17796-5_9
Manfred Schmidt-Schauß
David Sabel
2010
Closures of may-, should-and must-convergences for contextual equivalence
Information Processing Letters
110
6
232–235
10.1016/j.ipl.2010.01.001
Traian Florin Şerbănuţă
Grigore Roşu
José Meseguer
2009
A Rewriting Logic Approach to Operational Semantics
Information and Computation
207
2
305–340
10.1016/j.ic.2008.03.026
Dominic Steinhöfel
Nathan Wasser
2017
A New Invariant Rule for the Analysis of Loops with Non-standard Control Flows
iFM
279–294
10.1007/978-3-319-66845-1_18
Glynn Winskel
1993
The formal semantics of programming languages. Foundations of Computing