A formalization of programs in first-order logic with a discrete linear order (Q274400): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2016.01.014 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Daikon / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GOLOG / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2016.01.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2264437737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The temporal semantics of concurrent programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis of loop predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of invariants and intermediate assertions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Daikon system for dynamic detection of likely invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program verification through characteristic formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic formulae for the verification of imperative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight, consistent, and computable completions for unrestricted logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GOLOG: A logic programming language for dynamic domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999301 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2016.01.014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:03, 9 December 2024

scientific article
Language Label Description Also known as
English
A formalization of programs in first-order logic with a discrete linear order
scientific article

    Statements

    Identifiers