Duration Calculus

Hansen, Michael R.

doi:10.1007/978-3-540-74107-7_6

Cited by 3 publications

(1 citation statement)

References 81 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Termination is a special case of a timing property [Hehner 1989]. Resource properties can be expressed in specification languages such as timed automata [Alur et al 1990], TPTL [Alur and Henzinger 1994], metric temporal logic [Ouaknine and Worrell 2005], HighSpec [Dong et al 2006], CS-OZ-DC [Olderog 2008], UPPAAL [Larsen et al 1997], Esterel [Berry 2000], Lustre [Halbwachs et al 1992;Pilaud et al 1987], and the duration calculus [Hansen 2008]. Timing properties for events in code can be specified in the PSpec language [Perl and Weihl 1993] and Real-time Euclid [Kligerman and Stoyenko 1992;Stoyenko 1992].…”

Section: Classification Of Specificationsmentioning

confidence: 99%

Behavioral interface specification languages

et al. 2012

View full text Add to dashboard Cite

Behavioral interface specification languages provide formal code-level annotations, such as preconditions, postconditions, invariants, and assertions that allow programmers to express the intended behavior of program modules. Such specifications are useful for precisely documenting program behavior, for guiding implementation, and for facilitating agreement between teams of programmers in modular development of software. When used in conjunction with automated analysis and program verification tools, such specifications can support detection of common code vulnerabilities, capture of light-weight application-specific semantic properties, generation of test cases and test oracles, and full formal program verification. This article surveys behavioral interface specification languages with a focus toward automatic program verification and with a view towards aiding the Verified Software Initiative-a fifteen-year, cooperative, international project directed at the scientific challenges of large-scale software verification.

show abstract