Sciweavers

5624 search results - page 474 / 1125
» On Conditional Covering Problem
Sort
View
FSTTCS
2009
Springer
16 years 1 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
LPNMR
2009
Springer
16 years 1 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
ITICSE
2009
ACM
16 years 1 months ago
Software reuse and plagiarism: a code of practice
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signi...
J. Paul Gibson
KCAP
2009
ACM
16 years 1 months ago
Knowledge engineering rediscovered: towards reasoning patterns for the semantic web
The extensive work on Knowledge Engineering in the 1990s has resulted in a systematic analysis of task-types, and the corresponding problem solving methods that can be deployed fo...
Frank van Harmelen, Annette ten Teije, Holger Wach...
ASWEC
2008
IEEE
16 years 1 months ago
Modeling Input Validation in UML
Security is an integral part of most software systems but it is not considered as an explicit part in the development process yet. Input validation is the most critical part of so...
Pedram Hayati, Nastaran Jafari, S. Mohammad Rezaei...