Sciweavers

313 search results - page 10 / 63
» Model equivalence of PRISM programs
Sort
View
MSCS
2008
97views more  MSCS 2008»
13 years 7 months ago
Logical relations for monadic types
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
ICLP
2007
Springer
14 years 1 months ago
Minimal Logic Programs
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
Pedro Cabalar, David Pearce, Agustín Valver...
CVPR
2011
IEEE
13 years 4 months ago
Enforcing Similarity Constraints with Integer Programming for Better Scene Text Recognition
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
David Smith, Jacqueline Feild, Eric Learned-Miller
ENTCS
2006
168views more  ENTCS 2006»
13 years 7 months ago
A Functional Programming Framework for Latency Insensitive Protocol Validation
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla...
ICALP
2004
Springer
14 years 1 months ago
A Calculus of Coroutines
We describe a simple but expressive calculus of sequential processes, represented as coroutines. We show that this calculus can be used to express a variety of programming languag...
James Laird