Sciweavers

131 search results - page 10 / 27
» Proof systems that take advice
Sort
View
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
15 years 11 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
LICS
2008
IEEE
16 years 8 days ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
AOSD
2010
ACM
16 years 22 days ago
A theory of distributed aspects
Over the last five years, several systems have been proposed to take distribution into account in Aspect-Oriented Programming. While they appeared to be fruitful to develop or im...
Nicolas Tabareau
ECAI
2004
Springer
15 years 9 months ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease
UML
2001
Springer
15 years 10 months ago
Agile Modeling: A Brief Overview
: Agile Modeling (AM) is a practice-based methodology for effective modeling of software-based systems. Where the Unified Modeling Language (UML) defines a subset of the modeling t...
Scott W. Ambler