Sciweavers

1916 search results - page 279 / 384
» Reasoning with class algebra
Sort
View
LICS
2005
IEEE
14 years 2 months ago
Reactive Systems over Cospans
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for...
Vladimiro Sassone, Pawel Sobocinski
TPHOL
2005
IEEE
14 years 2 months ago
From PSL to LTL: A Formal Validation in HOL
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
Thomas Tuerk, Klaus Schneider
TLDI
2005
ACM
126views Formal Methods» more  TLDI 2005»
14 years 2 months ago
Type inference for atomicity
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
Cormac Flanagan, Stephen N. Freund, Marina Lifshin
APPROX
2005
Springer
80views Algorithms» more  APPROX 2005»
14 years 2 months ago
On Learning Random DNF Formulas Under the Uniform Distribution
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
Jeffrey C. Jackson, Rocco A. Servedio
ESOP
2005
Springer
14 years 2 months ago
Towards a Type System for Analyzing JavaScript Programs
JavaScript is a popular language for client-side web scripting. It has a dubious reputation among programmers for two reasons. First, many JavaScript programs are written against a...
Peter Thiemann