The following pages link to Formal Aspects of Computing (Q164203):
Displaying 50 items.
- Eliminating the substitution axiom from UNITY logic (Q751848) (← links)
- Special issue: Extended papers based on the presentations at the eighth IEEE international conference on software engineering and formal methods, Pisa, Italy, September 13--18, 2010 (Q763211) (← links)
- Linearizability on hardware weak memory models (Q782494) (← links)
- Using formal verification to evaluate the execution time of Spark applications (Q782497) (← links)
- Formal reliability and failure analysis of Ethernet based communication networks in a smart grid substation (Q782499) (← links)
- Book review of: G. O'Regan, Concise guide to formal methods: theory, fundamentals and industry applications (Q782500) (← links)
- Book review of: A. Platzer, Logical foundations of cyber-physical systems (Q782501) (← links)
- Correction to: ``Multiple model synchronization with multiary delta lenses with amendment and K-Putput'' (Q782503) (← links)
- Normalising the associative law: An experiment with Martin-Löf's type theory (Q809071) (← links)
- An Event-B based approach for cloud composite services verification (Q826351) (← links)
- TFA: an efficient and precise virtual method call resolution for Java (Q826353) (← links)
- Formalization of camera pose estimation algorithm based on Rodrigues formula (Q826358) (← links)
- Special issue: Concurrency and real-time for Eiffel-like languages. Papers from a workshop, York, UK, July 2006 (Q833009) (← links)
- Contracts for concurrency (Q846109) (← links)
- Beyond contracts for concurrency (Q846113) (← links)
- Flexible access control policy for SCOOP (Q846114) (← links)
- Cameo: an alternative model of concurrency for Eiffel (Q846117) (← links)
- Special issue: Refinement. Papers from the 12th BCS-FACS refinement workshop, Oxford, UK, July 2007. (Q848793) (← links)
- Angelic nondeterminism in the unifying theories of programming (Q851128) (← links)
- Verifying data refinements using a model checker (Q851129) (← links)
- Tank monitoring: A pAMN case study (Q851131) (← links)
- An analysis of refinement in an abortive paradigm (Q851133) (← links)
- The specification logic \(\nu \)Z (Q851135) (← links)
- Integrated formal methods. Selected papers based on the presentations at the 4th integrated formal methods conference, Canterbury, UK, April 4--7, 2004 (Q851919) (← links)
- How to stop time stopping (Q855006) (← links)
- A calculus and logic of resources and processes (Q855007) (← links)
- On modelling recursive calls and callbacks with two variants of unified modelling language state diagrams (Q855010) (← links)
- An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
- Analysis of a biphase mark protocol with Uppaal and PVS (Q855013) (← links)
- Formal techniques for performance analysis: blending SAN and PEPA (Q877152) (← links)
- Verifying a signature architecture: a comparative case study (Q877156) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- An engineering process for the verification of real-time systems (Q877159) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
- Strategy based semantics for mobility with time and access permissions (Q890480) (← links)
- Compositional reasoning about active objects with shared futures (Q890481) (← links)
- Untanglings: a novel approach to analyzing concurrent systems (Q903488) (← links)
- Model checking the observational determinism security property using PROMELA and SPIN (Q903490) (← links)
- Generating invariants for non-linear loops by linear algebraic methods (Q903492) (← links)
- Categorical foundations for structured specifications in \(\mathsf{Z}\) (Q903494) (← links)
- Finding semantic associations in hierarchically structured groups of web data (Q903496) (← links)
- Typed context awareness ambient calculus for pervasive applications (Q903500) (← links)
- Accelerating worst case execution time analysis of timed automata models with cyclic behaviour (Q903501) (← links)
- A reduced maximality labeled transition system generation for recursive Petri nets (Q903505) (← links)
- Verification of distributed systems with the axiomatic system of MSVL (Q903507) (← links)
- Formal probabilistic analysis of detection properties in wireless sensor networks (Q903510) (← links)
- Integrating stochastic reasoning into Event-B development (Q903513) (← links)
- Using formal reasoning on a model of tasks for FreeRTOS (Q903515) (← links)
- Denotational semantics and its algebraic derivation for an event-driven system-level language (Q903516) (← links)
- A framework for model transformation verification (Q903517) (← links)
