Sciweavers

151 search results - page 9 / 31
» Examples of Program Composition Illustrating the Use of Univ...
Sort
View
ISSTA
2000
ACM
13 years 11 months ago
Verifying properties of process definitions
ions for concise and precise specification of such control, but balance this with visualization support to help users also obtain intuitive insights. The underlying complexhese con...
Jamieson M. Cobleigh, Lori A. Clarke, Leon J. Oste...
SIGSOFT
2003
ACM
14 years 8 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
IFIP
2010
Springer
13 years 2 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
CC
1998
Springer
134views System Software» more  CC 1998»
13 years 11 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
APIN
2005
94views more  APIN 2005»
13 years 7 months ago
Extension of Petri Nets for Representing and Reasoning with Tasks with Imprecise Durations
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
Stanislav Kurkovsky, Rasiah Loganantharaj