Sciweavers

778 search results - page 45 / 156
» Improved universal denominators
Sort
View
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
15 years 4 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
LATA
2009
Springer
15 years 4 months ago
On Extended Regular Expressions
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
Benjamin Carle, Paliath Narendran
HICSS
2007
IEEE
113views Biometrics» more  HICSS 2007»
15 years 4 months ago
Secure Software Engineering: A New Paradigm
Software defects lead to security vulnerabilities, which are costing businesses millions of dollars each year and threaten the security of individuals and the nation. It can be de...
Wm. Arthur Conklin, Glenn B. Dietrich
IFL
2005
Springer
107views Formal Methods» more  IFL 2005»
15 years 3 months ago
With-Loop Fusion for Data Locality and Parallelism
With-loops are versatile array comprehensions used in the functional array language SaC to implement universally applicable array operations. We describe the fusion of with-loops a...
Clemens Grelck, Karsten Hinckfuß, Sven-Bodo ...
3DIM
2003
IEEE
15 years 3 months ago
Solving architectural modelling problems using knowledge
This paper summarizes a series of recent research results made at Edinburgh University based applying domain knowledge of standard shapes and relationships to solve or improve arc...
Robert B. Fisher