Sciweavers

1636 search results - page 176 / 328
» Type-Theoretic Functional Semantics
Sort
View
POPL
2006
ACM
16 years 7 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 1 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
16 years 1 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
EDBTW
2004
Springer
16 years 8 days ago
MIRA: Multilingual Information Processing on Relational Architecture
In today’s global village, it is critical that the key information tools, such as web search engines, e-Commerce portals and e-Governance, work across multiple natural languages,...
A. Kumaran
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
16 years 5 days ago
Development and Application of Design Transformations in ForSyDe
The ForSyDe methodology has been developed for system level design. Starting with a formal specification model, that captures the functionality of the system at a high abstractio...
Ingo Sander, Axel Jantsch, Zhonghai Lu