Sciweavers

394 search results - page 43 / 79
» Formal polytypic programs and proofs
Sort
View
ICFP
2007
ACM
14 years 8 months ago
Ott: effective tool support for the working semanticist
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
Peter Sewell, Francesco Zappa Nardelli, Scott Owen...
ESOP
2007
Springer
14 years 2 months ago
Probabilistic Anonymity Via Coalgebraic Simulations
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...
Ichiro Hasuo, Yoshinobu Kawabe
MPC
2004
Springer
97views Mathematics» more  MPC 2004»
14 years 1 months ago
Friends Need a Bit More: Maintaining Invariants Over Shared State
A friendship system is introduced for modular static verification of object invariants. It extends a previous methodology, based on ownership hierarchy encoded in auxiliary state,...
Michael Barnett, David A. Naumann
APLAS
2010
ACM
13 years 8 months ago
Reasoning about Computations Using Two-Levels of Logic
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
Dale Miller
TPHOL
2009
IEEE
14 years 2 months ago
Trace-Based Coinductive Operational Semantics for While
We present four coinductive operational semantics for the While language accounting for both terminating and non-terminating program runs: big-step and small-step relational semant...
Keiko Nakata, Tarmo Uustalu