Sciweavers

10072 search results - page 1389 / 2015
» Composition of Model Programs
Sort
View
237
Voted
ICLA
2011
Springer
14 years 10 months ago
A Stochastic Interpretation of Propositional Dynamic Logic: Expressivity
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
Ernst-Erich Doberkat
213
Voted
IGPL
2011
14 years 10 months ago
Generalized ordinal sums and translations
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...
Nikolaos Galatos
204
Voted
ICSE
2008
IEEE-ACM
16 years 8 months ago
Calysto: scalable and precise extended static checking
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
Domagoj Babic, Alan J. Hu
216
Voted
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
16 years 7 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman
180
Voted
ICFP
2007
ACM
16 years 7 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
« Prev « First page 1389 / 2015 Last » Next »