Dynamic Logic with Trace Semantics

Beckert, Bernhard; Bruns, Daniel

doi:10.1007/978-3-642-38574-2_22

Cited by 14 publications

(8 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ideally, there is a single evaluation rule for each construct of the target language that can be applied independently from all other rules: the recursive call to evaluate subsequent statements is not inside the semantic evaluation of each statement. This is not only a good match with deductive verification rules of program logics [35], but also with formal specification languages for concurrent programs that have a trace semantics [65,12,27,67,51].…”

Section: Introductionmentioning

confidence: 85%

“…To reduce technicalities, we assume without loss of generality that a method call has one argument and no return value on which the caller needs to synchronise. 12 In contrast to parallel co s || s oc statements, where parallelism is explicit in the program syntax, procedure calls introduce implicit parallel execution: there is a context switch between the syntactic call site and the processor, whereupon the call is executed in parallel. This decoupling has an important consequence: according to the local evaluation principle, method bodies are evaluated independently of the call context.…”

Section: Procedures Callsmentioning

confidence: 99%

“…Historically, it is more common to use the term procedure, whereas in object-oriented programming the term method is usual, which is where the LAGC concept originated from. We use both terms interchangeably 12. Synchronisation on return values is discussed in Section 7.3.…”

mentioning

confidence: 99%

See 2 more Smart Citations

LAGC Semantics of Concurrent Programming Languages

Din¹,

Hähnle²,

Henrio³

et al. 2022

Preprint

View full text Add to dashboard Cite

Formal, mathematically rigorous programming language semantics are the essential prerequisite for the design of logics and calculi that permit automated reasoning about concurrent programs. We propose a novel modular semantics designed to align smoothly with program logics used in deductive verification and formal specification of concurrent programs. Our semantics separates local evaluation of expressions and statements performed in an abstract, symbolic environment from their composition into global computations, at which point they are concretised. This makes incremental addition of new language concepts possible, without the need to revise the framework. The basis is a generalisation of the notion of a program trace as a sequence of evolving states that we enrich with event descriptors and trailing continuation markers. This allows to postpone scheduling constraints from the level of local evaluation to the global composition stage, where well-formedness predicates over the event structure declaratively characterise a wide range of concurrency models. We also illustrate how a sound program logic and calculus can be defined for this semantics. Basics StatesWe assume given standard basic types, including integers, Booleans and process identifiers, with standard value domains and associated operators. In addition, we allow starred expressions, representing unknown, symbolic values.Definition 1 (Variables, Values, (Starred) Expressions). Let Var be a set of program variables, Val a set of values, and Op a set of operators, with typical elements x, v, and op, respectively. The sets Val and Op

show abstract

Section: Introductionmentioning

confidence: 85%

Section: Procedures Callsmentioning

confidence: 99%

See 1 more Smart Citation

LAGC Semantics of Concurrent Programming Languages

Din¹,

Hähnle²,

Henrio³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Symbolic Execution in BPL. As mentioned above, established calculi for dynamic logics (like JavaDL [1], ABSDL [11] or DTL [4]) perform symbolic execution by reducing the statement inside a modality without considering the post-condition. In contrast, for each step in a behavioral type system [2], the statement is matched with the current specification.…”

Section: Behavioral Program Logicmentioning

confidence: 99%

Crowbar: Behavioral Symbolic Execution for Deductive Verification of Active Objects

Kamburjan¹,

Scaletta²,

Rollshausen³

2021

Preprint

View full text Add to dashboard Cite

We present the Crowbar tool, a deductive verification system for the ABS language. ABS models distributed systems with the Active Object concurrency model. Crowbar implements behavioral symbolic execution: each method is symbolically executed, but specification and prior static analyses influence the shape of the symbolic execution tree. User interaction is realized through guided counterexamples, which present failed proof branches in terms of the input program. Crowbar has a clear interface to implement new specification languages and verification calculi in the Behavioral Program Logic and has been applied for the biggest verification case study of Active Objects.

show abstract

“…Deductive Verification of Imperative Programs An alternative approach is to use a co-inductive approach to directly verify imperative programs [59]. [16] presents Dynamic Trace Logic (DTL), which combines dynamic logic with temporal logic, allowing to prove functional and information-flow properties in concurrent programs. Properties of interactive programs are specified using modal operators.…”

Section: Formalizations In Isabellementioning

confidence: 99%