Sciweavers

1001 search results - page 176 / 201
» Testing Formal Dialectic
Sort
View
ENTCS
2006
172views more  ENTCS 2006»
13 years 7 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
IJSWIS
2007
171views more  IJSWIS 2007»
13 years 7 months ago
Experience in Aligning Anatomical Ontologies
An ontology is a formal representation of a domain modeling the entities in the domain and their relations. When a domain is represented by multiple ontologies, there is need for ...
Songmao Zhang, Olivier Bodenreider
JAR
2000
145views more  JAR 2000»
13 years 7 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
SIGCSE
2002
ACM
202views Education» more  SIGCSE 2002»
13 years 7 months ago
A tutorial program for propositional logic with human/computer interactive learning
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propo...
Stacy Lukins, Alan Levicki, Jennifer Burg
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 6 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...