The following pages link to Formal Aspects of Computing (Q164203):
Displaying 50 items.
- Synthesizing bounded-time 2-phase fault recovery (Q903518) (← links)
- Issues in the design of a parallel object-oriented language (Q909434) (← links)
- A functional programming approach to the specification and verification of concurrent systems (Q909439) (← links)
- A logic for Miranda (Q909443) (← links)
- Term rewriting and beyond -- theorem proving in Isabelle (Q909488) (← links)
- A refinement calculus for specifications in Hennessy-Milner logic with recursion (Q911261) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- Event fairness and non-interleaving concurrency (Q911318) (← links)
- Process simulation and refinement (Q911322) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- Branching versus linear logics yet again (Q911747) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- A fast pattern matching algorithm derived by transformational and assertional reasoning (Q911750) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- Partial order behaviour and structure of Petri nets (Q911779) (← links)
- Equational reasoning about nondeterministic processes (Q911801) (← links)
- Axioms and models of linear logic (Q915719) (← links)
- The projection of systolic programs (Q916375) (← links)
- Chain properties of rule closures (Q916402) (← links)
- Refinement concepts formalised in higher order logic (Q916409) (← links)
- Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems (Q916414) (← links)
- Defining, analysing and implementing communication protocols using attribute grammars (Q919803) (← links)
- X-machines and the halting problem: Building a super-turing machine (Q919823) (← links)
- Modelling multiple inheritance with colimits (Q919836) (← links)
- Proof obligations for blocks and procedures (Q919838) (← links)
- On the interconnection constants of Hopfield nets (Q919842) (← links)
- A functional formalization of on chip communications (Q931433) (← links)
- Formalizing non-interference for a simple bytecode language in Coq (Q931434) (← links)
- Specification of communicating processes: temporal logic versus refusals-based refinement (Q931435) (← links)
- Data refinement and singleton failures refinement are not equivalent (Q931436) (← links)
- John Warner Backus: 3 Dec 1924-17 March 2007 (Q931437) (← links)
- Efficient representation of the attacker's knowledge in cryptographic protocols analysis (Q931442) (← links)
- Capture-avoiding substitution as a nominal algebra (Q939160) (← links)
- Bisimulations in calculi modelling membranes (Q939161) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- A compositional Petri net translation of general \(\pi\)-calculus terms (Q939164) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- Algebra and logic for access control (Q968301) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- A formalization of geometric constraint systems and their decomposition (Q968304) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- Generating certified code from formal proofs: a case study in homological algebra (Q968307) (← links)
- Special issue: International conference on fundamental approaches to software engineering (FASE 2008), one of the European joint conferences on theory and practice of software (ETAPS 2008), Budapest, Hungary, March 31st to April 2nd 2008. Selected papers (Q972020) (← links)
- Preserving correctness during business process model configuration (Q973035) (← links)
- Automating the transformation-based analysis of visual languages (Q973037) (← links)
- From a domain analysis to the specification and detection of code and design smells (Q973043) (← links)
- Reasoning with graph constraints (Q973044) (← links)
- From StPowla processes to SRML models (Q973047) (← links)
