Sciweavers

255 search results - page 27 / 51
» Proving BDI Properties of Agent-Oriented Programming Languag...
Sort
View
CC
2004
Springer
15 years 11 months ago
Developing a Foundation for Code Optimization
Although optimization technology has been successful over the past 40 years, recent trends are emerging that demand we reconsider the paradigm that we are using for code optimizati...
Mary Lou Soffa
PROVSEC
2007
Springer
16 years 3 days ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti
APAL
2005
90views more  APAL 2005»
15 years 5 months ago
Explicit mathematics: power types and overloading
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...
Thomas Studer
ENTCS
2002
91views more  ENTCS 2002»
15 years 5 months ago
Subtyping in Logical Form
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
Ugo de'Liguoro
LATA
2009
Springer
16 years 23 days ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig