Verifying Whiley Programs with Boogie (English)
Free access
- New search for: Pearce, David J.
- Further information on Pearce, David J.:
- https://orcid.org/http://orcid.org/0000-0003-4535-9677
- New search for: Utting, Mark
- Further information on Utting, Mark:
- https://orcid.org/http://orcid.org/0000-0003-3134-6306
- New search for: Groves, Lindsay
- Further information on Groves, Lindsay:
- https://orcid.org/http://orcid.org/0000-0002-9179-3602
- New search for: Pearce, David J.
- Further information on Pearce, David J.:
- https://orcid.org/http://orcid.org/0000-0003-4535-9677
- New search for: Utting, Mark
- Further information on Utting, Mark:
- https://orcid.org/http://orcid.org/0000-0003-3134-6306
- New search for: Groves, Lindsay
- Further information on Groves, Lindsay:
- https://orcid.org/http://orcid.org/0000-0002-9179-3602
In:
Journal of Automated Reasoning
;
66
, 4
;
747-803
;
2022
- Article (Journal) / Electronic Resource
-
Title:Verifying Whiley Programs with Boogie
-
Additional title:J Autom Reasoning
-
Contributors:
-
Published in:Journal of Automated Reasoning ; 66, 4 ; 747-803
-
Publisher:
- New search for: Springer Netherlands
-
Place of publication:Dordrecht
-
Publication date:2022-11-01
-
Size:57 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Licence:
-
Source:
Table of contents – Volume 66, Issue 4
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 437
-
Six Decades of Automated Reasoning: Papers in Memory of Larry WosBonacina, Maria Paola et al. | 2022
- 439
-
Larry Wos: Visions of Automated ReasoningBeeson, Michael / Bonacina, Maria Paola / Kinyon, Michael / Sutcliffe, Geoff et al. | 2022
- 463
-
Set of Support, Demodulation, Paramodulation: A Historical PerspectiveBonacina, Maria Paola et al. | 2022
- 499
-
A Comprehensive Framework for Saturation Theorem ProvingWaldmann, Uwe / Tourret, Sophie / Robillard, Simon / Blanchette, Jasmin et al. | 2022
- 541
-
Making Higher-Order Superposition WorkVukmirović, Petar / Bentkamp, Alexander / Blanchette, Jasmin / Cruanes, Simon / Nummelin, Visa / Tourret, Sophie et al. | 2022
- 565
-
A Wos Challenge MetVeroff, Robert et al. | 2022
- 575
-
A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished ColumnTourret, Sophie / Weidenbach, Christoph et al. | 2022
- 585
-
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability TheoryLochbihler, Andreas et al. | 2022
- 611
-
A Formalization of Dedekind Domains and Class Groups of Global FieldsBaanen, Anne / Dahmen, Sander R. / Narayanan, Ashvni / Nuccio Mortarino Majno di Capriglio, Filippo A. E. et al. | 2022
- 639
-
Local is Best: Efficient Reductions to Modal Logic KPapacchini, Fabio / Nalon, Cláudia / Hustadt, Ullrich / Dixon, Clare et al. | 2022
- 667
-
Tuple Interpretations for Termination of Term RewritingYamada, Akihisa et al. | 2022
- 689
-
Theorem Proving as Constraint Solving with Coherent LogicJaničić, Predrag / Narboux, Julien et al. | 2022
- 747
-
Verifying Whiley Programs with BoogiePearce, David J. / Utting, Mark / Groves, Lindsay et al. | 2022
- 805
-
Fast Left Kan Extensions Using the ChaseMeyers, Joshua / Spivak, David I. / Wisnesky, Ryan et al. | 2022
- 845
-
Faster Linear Unification Algorithmde Champeaux, Dennis et al. | 2022
- 861
-
Pardinus: A Temporal Relational Model FinderMacedo, Nuno / Brunel, Julien / Chemouil, David / Cunha, Alcino et al. | 2022
- 905
-
From Specification to Testing: Semantics Engineering for Lua 5.2Soldevila, Mallku / Ziliani, Beta / Silvestre, Bruno et al. | 2022
- 953
-
Towards Formalising Schutz’ Axioms for Minkowski Spacetime in Isabelle/HOLSchmoetten, Richard / Palmer, Jake E. / Fleuriot, Jacques D. et al. | 2022
- 989
-
A Formalization of SQL with NullsRicciotti, Wilmer / Cheney, James et al. | 2022
- 1031
-
Formalization of the Computational Theory of a Turing Complete Functional Language ModelRamos, Thiago Mendonça Ferreira / Almeida, Ariane Alves / Ayala-Rincón, Mauricio et al. | 2022
- 1065
-
A Formalization of the Smith Normal Form in Higher-Order LogicDivasón, Jose / Thiemann, René et al. | 2022
- 1097
-
Correction to: A Formalization of the Smith Normal Form in Higher-Order LogicDivasón, Jose / Thiemann, René et al. | 2022
- 1099
-
Correction to: Local is Best: Efficient Reductions to Modal Logic KPapacchini, Fabio / Nalon, Cláudia / Hustadt, Ullrich / Dixon, Clare et al. | 2022