Sciweavers

286 search results - page 23 / 58
» Reasoning about multiple related abstractions with MultiStar
Sort
View
QEST
2005
IEEE
15 years 3 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha
ESOP
2011
Springer
14 years 1 months ago
General Bindings and Alpha-Equivalence in Nominal Isabelle
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
Christian Urban, Cezary Kaliszyk
HASKELL
2009
ACM
15 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
FSEN
2007
Springer
15 years 3 months ago
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
Mahdi Niamanesh, Rasool Jalili
FOIS
2001
14 years 11 months ago
Type-syntax and token-syntax in diagrammatic systems
The uptake in the software industry of notations for designing systems visually has been accelerated with the standardization of the Unified Modeling Language (UML). The formaliza...
John Howse, Fernando Molina, John Taylor, Sun-Joo ...