Sciweavers

1187 search results - page 36 / 238
» Graph-Based Procedural Abstraction
Sort
View
LPAR
2004
Springer
15 years 3 months ago
Evaluating QBFs via Symbolic Skolemization
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
Marco Benedetti
SIBGRAPI
1999
IEEE
15 years 1 months ago
An Algorithm for Two-Dimensional Mesh Generation for Arbitrary Regions with Cracks
Abstract. This paper describes an algorithm for generating unstructured triangulations for arbitrarily shaped twodimensional regions. The algorithm works for regions without cracks...
Antonio C. O. Miranda, Joaquim B. Cavalcante Neto,...
INFORMATICALT
2000
157views more  INFORMATICALT 2000»
14 years 9 months ago
The Analysis of Unstructured Processes in Business Administration
Abstract. One of the problem in business process reengineering is the identification and implementation of new workflow procedures for specific business processes, if they are not ...
Alvydas Jaliniauskas
71
Voted
ICALP
2005
Springer
15 years 3 months ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch
HYBRID
2007
Springer
15 years 1 months ago
Diagnosability Verification for Hybrid Automata
A notion of diagnosability for hybrid systems is defined, which generalizes the notion of observability. We verify bility properties on a timed automaton abstraction of the origina...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...