Sciweavers

1912 search results - page 201 / 383
» On the evaluation of argumentation formalisms
Sort
View
DAGSTUHL
1996
15 years 7 months ago
An Automatic Interprocedural Analysis for the Understanding of Scientific Application Programs
This paper reports on an approachfor improvingthe understandingof old programs which have become very complex due to numerous extensions. We have adapted partial evaluation techni...
Sandrine Blazy, Philippe Facon
ASE
2007
121views more  ASE 2007»
15 years 6 months ago
Computer-aided Support for Secure Tropos
In earlier work, we have introduced Secure Tropos, a requirements engineering methodology that extends the Tropos methodology and is intended for the design and analysis of securit...
Fabio Massacci, John Mylopoulos, Nicola Zannone
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
ENTCS
2007
86views more  ENTCS 2007»
15 years 6 months ago
Tinycals: Step by Step Tacticals
Most of the state-of-the-art proof assistants are based on procedural proof languages, scripts, and rely on LCF tacticals as the primary tool for tactics composition. In this pape...
Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacc...
JSAT
2006
69views more  JSAT 2006»
15 years 6 months ago
The SAT 2005 Solver Competition on Random Instances
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...
Oliver Kullmann