Probabilistic guarded commands mechanized in HOL

Probabilistic guarded commands mechanized in HOL

<p>The probabilistic guarded-command language (<em>pGCL</em>) contains both demonic and probabilistic non-determinism, which makes it suitable for reasoning about distributed random algorithms. Proofs are based on weakest precondition semantics, using an underlying logic of real- (...

Descripció completa

Dades bibliogràfiques
Autors principals:	Hurd, J, McIver, A, Morgan, C
Format:	Journal article
Idioma:	English
Publicat:	Elsevier 2005
Matèries:	Theory and automated verification

Ítems similars

Partial correctness for probabilistic demonic programs
per: McIver, A, et al.
Publicat: (2001)

Forward looking logics and automata
per: Ley, C
Publicat: (2011)

Automated quantitative software verification
per: Kattenbelt, M
Publicat: (2010)

Intersection types and higer-order model checking
per: Ramsay, S, et al.
Publicat: (2014)

Precise verification of C programs
per: Lewis, M
Publicat: (2014)

Incremental modelling for verified communication architectures
per: Boehm, P, et al.
Publicat: (2011)

Abstraction discovery and refinement for model checking by symbolic trajectory evaluation
per: Adams, S
Publicat: (2014)

An algebraic theory of componentised interaction
per: Chilton, C
Publicat: (2013)

Functions with local state: regularity and undecidability
per: Murawski, A
Publicat: (2005)

Game semantics based equivalence checking of higher-order programs
per: Hopkins, D, et al.
Publicat: (2012)

On learning assumptions for compositional verification of probabilistic systems
per: Feng, L
Publicat: (2014)

Repairing strings and trees
per: Riveros Jaeger, C
Publicat: (2013)

Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
per: Baier, C, et al.
Publicat: (2022)

An interpolating decision procedure for transitive relations with uninterpreted functions
per: Kroening, D, et al.
Publicat: (2009)

Quantitative verification of real-time properties with application to medical devices
per: Marco Diciolla, M, et al.
Publicat: (2014)

Study of Isabelle/HOL on Formal Algorithm Analysis and Code Generation
per: Haitao Wang, et al.
Publicat: (2021-01-01)

Abstract satisfaction
per: Haller, L
Publicat: (2013)

EL-ifying ontologies
per: Carral, D, et al.
Publicat: (2014)

Pushing the boundaries of tractable ontology reasoning
per: Carral, D, et al.
Publicat: (2014)

Static analyses over weak memory
per: Nimal, V, et al.
Publicat: (2014)

Tractable query answering for description logics via query rewriting
per: Perez-Urbina, H, et al.
Publicat: (2010)

Automated Verification of Building Components Using BIM Models and Point Clouds
per: Honti Richard, et al.
Publicat: (2020-09-01)

Decoding the Atmosphere: Optimising Probabilistic Forecasts with Information Gain
per: John R. Lawson, et al.
Publicat: (2024-04-01)

Verification of asynchronous concurrency and the shaped stack constraint
per: Kochems, J
Publicat: (2014)

Applications of process-oriented design
per: Whitehead, J, et al.
Publicat: (2014)

Program analysis with interpolants
per: Weissenbacher, G, et al.
Publicat: (2010)

Formal methods for the analysis of wireless network protocols
per: Fruth, M
Publicat: (2011)

A hierarchy of failures-based models: theory and application
per: Bolton, C, et al.
Publicat: (2005)

Reasoning about efficiency within a probabilistic calculus
per: McIver, A
Publicat: (1999)

Stateless HOL
per: Freek Wiedijk
Publicat: (2011-03-01)

Synthesis and alternating automata over real time
per: Jenkins, M, et al.
Publicat: (2012)

Topics in monitoring and planning for embedded real-time systems
per: Ho, H
Publicat: (2015)

Predicate Abstraction of ANSI-C Programs Using SAT
per: Clarke, E, et al.
Publicat: (2004)

Turba Tol Hol-Hol Tol. Venice, Italy, 2022
per: Alfredo Thiermann
Publicat: (2022-12-01)

Turba Tol Hol-Hol Tol. Venecia, Italia, 2022
per: Alfredo Thiermann
Publicat: (2022-12-01)

Reasoning about efficiency within a probabilistic μ-calculus
per: McIver, A
Publicat: (1999)

Automation Processes for Efficient Verification of Complex Systems: An Empirical Case Study
per: Rune Andre Haugen, et al.
Publicat: (2024-12-01)

AUTOMATION AND GAMIFICATION OF COMPUTER SCIENCE STUDY
per: Imre ZSIGMOND
Publicat: (2019-12-01)

Assessing Critical Adaptations in Automated Adaptive Software Systems by Stage Decomposition
per: Shuji Morisaki, et al.
Publicat: (2024-01-01)

STUDI KASUS LINGUSQL: APLIKASI TRANSAKSI PERDAGANGAN SAHAM
per: Rikky Wenang Purbojati, et al.
Publicat: (2012-07-01)