Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #51 to #100.

Highly dependable concurrent programming using design for verification: Label: en
Are the logical foundations of verifying compiler prototypes matching user expectations?: Label: en
Code-carrying theories: Label: en
Interactive tool support for CSP \(\parallel\) B consistency checking: Label: en
Responsiveness and stable revivals: Label: en
Generalised multi-pattern-based verification of programs with linear linked structures: Label: en
Predicate diagrams for the verification of real-time systems: Label: en
Program verification with interacting analysis plugins: Label: en
Proof producing synthesis of arithmetic and cryptographic hardware: Label: en
Verification of clock synchronization algorithms: experiments on a combination of deductive tools: Label: en
Real time process algebra: Label: en
Optimizing sorting algorithms by using sorting networks: Label: en
A program analysis framework for \textit{tccp} based on abstract interpretation: Label: en
Assumption propagation through annotated programs: Label: en
Transforming Boolean equalities into constraints: Label: en
Operational semantics of resolution and productivity in Horn clause logic: Label: en
Equational formulas and pattern operations in initial order-sorted algebras: Label: en
On dual programs in co-logic programming and the Horn \({\mu}\)-calculus: Label: en
Proof checking and logic programming: Label: en
Editorial: Label: en
Special Issue: Automated verification of critical systems (AVoCS). Selected and revised papers based on the presentation at the international workshop, Southhampton, UK, April 2--3, 2003.: Label: en
Verification of a sliding window protocol in \(\mu\) CRL and PVS: Label: en
Almost ASAP semantics: from timed models to timed implementations: Label: en
Validating a web service security abstraction by typing: Label: en
Security analysis of efficient (Un-) fair non-repudiation protocols: Label: en
The formal design of distributed controllers with \(_{\text d}\text{SL}\) and spin: Label: en
On the expressive power of CSP refinement: Label: en
A refinement-based process algebra for timed automata: Label: en
Refinement is complete for implementations: Label: en
Using probabilistic model checking for dynamic power management: Label: en
Not necessarily closed convex polyhedra and the double description method: Label: en
Model checking, testing and verification working together: Label: en
An algebraic treatment of procedure refinement to support mechanical verification: Label: en
Discovering applications of higher order functions through proof planning: Label: en
Mechanizing compositional reasoning for concurrent systems: some lessons: Label: en
A computer checked algebraic verification of a distributed summation algorithm: Label: en
Modeling layered distributed communication systems: Label: en
Errata for ``A calculus and logic of resources and processes and their consequences: Label: en
Minimal refinements of specifications in modal and temporal logics: Label: en
An approach to formal verification of human-computer interaction: Label: en
A CSP model of Eiffel's SCOOP: Label: en
Thread algebra for strategic interleaving: Label: en
Deciding orthogonal bisimulation: Label: en
Procedure compilation in the refinement calculus: Label: en
Finite integer computations: An algebraic foundation for their correctness: Label: en
Formal aspects of correctness and optimality of interval computations: Label: en
Action refinement applied to late decisions: Label: en
A singleton failures semantics for communicating sequential processes: Label: en
The verified software repository: a step towards the verifying compiler: Label: en
A formal relationship between program slicing and partial evaluation: Label: en