The following pages link to Formal Aspects of Computing (Q164203):
Displaying 50 items.
- The mechanical generation of fault trees for reactive systems via retrenchment. II. Clocked and feedback circuits (Q470020) (← links)
- Statechartable Petri nets (Q470022) (← links)
- On theorem prover-based testing (Q470025) (← links)
- Constructing and visualizing chemical reaction networks from pi-calculus models (Q470031) (← links)
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics (Q470035) (← links)
- Towards formally specifying and verifying transactional memory (Q470040) (← links)
- A calculus of trustworthy ad hoc networks (Q470043) (← links)
- Structural transformations for data-enriched real-time systems (Q493518) (← links)
- Program equivalence by circular reasoning (Q493521) (← links)
- Quantified abstract configurations of distributed systems (Q493525) (← links)
- A compositional automata-based semantics and preserving transformation rules for testing property patterns (Q493531) (← links)
- An algebraic theory for web service contracts (Q493534) (← links)
- Component-wise incremental LTL model checking (Q510894) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- A language-independent proof system for full program equivalence (Q510898) (← links)
- Maximal incompleteness as obfuscation potency (Q511013) (← links)
- Partial evaluation of string obfuscations for Java malware detection (Q511016) (← links)
- On proving confluence modulo equivalence for Constraint Handling Rules (Q511019) (← links)
- Constraint logic programming with a relational machine (Q511023) (← links)
- Abstract conjunctive partial deduction for the analysis and compilation of coroutines (Q511025) (← links)
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Obituary: Amílcar Sernadas (1952--2017) (Q520233) (← links)
- Manifest domains: analysis and description (Q520235) (← links)
- Refining autonomous agents with declarative beliefs and desires (Q520236) (← links)
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- A Maude environment for CafeOBJ (Q520244) (← links)
- Complete model-based equivalence class testing for nondeterministic systems (Q520246) (← links)
- Deriving bisimulation relations from path based equivalence checkers (Q520250) (← links)
- A formal approach for the construction and verification of railway control systems (Q539161) (← links)
- Symbolic decision procedure for termination of linear programs (Q539162) (← links)
- VDM semantics of programming languages: Combinators and monads (Q539163) (← links)
- A denotational semantics for Handel-C (Q539165) (← links)
- Z2SAL: a translation-based model checker for Z (Q539218) (← links)
- Proving linearizability with temporal logic (Q539223) (← links)
- Generating tests from B specifications and dynamic selection criteria (Q539227) (← links)
- A data-flow approach to test multi-agent ASMs (Q539229) (← links)
- On the purpose of Event-B proof obligations (Q539230) (← links)
- Retrenchment for Event-B: UseCase-wise development and Rodin integration (Q539231) (← links)
- Automated verification and refinement for physical-layer protocols (Q539420) (← links)
- The dynamic frames theory (Q539422) (← links)
- Elucidating concurrent algorithms via layers of abstraction and reification (Q539423) (← links)
- Partial order semantics for use case and task models (Q539426) (← links)
- Model checking with bounded context switching (Q539429) (← links)
- Soundness of workflow nets: classification, decidability, and analysis (Q539433) (← links)
- The humble humorous researcher: A tribute to Michel Sintzoff (Q539435) (← links)
- Solutions of equations in languages (Q607397) (← links)
- An algebraic approach to the design of compilers for object-oriented languages (Q607399) (← links)
- Blaming the client: on data refinement in the presence of pointers (Q607403) (← links)
- A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← links)
- Structured derivations: a unified proof style for teaching mathematics (Q607406) (← links)
