Transforming concurrent programs with semaphores into logically constrained term rewrite systems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Programming languages and operational semantics. A concise overview
Decision procedures. An algorithmic point of view
Ensuring the quasi-termination of needed narrowing computations
An overview of the K semantic framework
All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
Termination of rewriting
Conditional rewriting logic as a unified model of concurrency
Loop detection by logically constrained term rewriting
A coinductive approach to proving reachability properties in logically constrained term rewriting systems
Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Proceedings
Automatic Constrained Rewriting Induction towards Verifying Procedural Programs
Term Rewriting with Logical Constraints
Rewriting Induction + Linear Arithmetic = Decision Procedure
Formalizing the LLVM intermediate representation for verified program transformations
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
All-Path Reachability Logic
One-Path Reachability Logic
Verifying Procedural Programs via Constrained Rewriting Induction
Operationally-based program equivalence proofs using LCTRSs
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting
Rewriting logic as a semantic framework for concurrency: a progress report
The Maude strategy language
Term rewriting induction

This page was built for publication: Transforming concurrent programs with semaphores into logically constrained term rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671788)