2881 search results - page 347 / 577 » Model Checking for Programming Languages using Verisoft |
159
click to vote
PADL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
155
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
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...
177
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
176
click to vote
WCRE
2000
IEEE
15 years 11 months ago
2000
IEEE
One of the most important issue in source code analysis and software re-engineering is the representation of ode text at an abstraction level and form suitable for algorithmic pro...
173
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...