Sciweavers

365 search results - page 41 / 73
» Using Types as Approximations for Type Checking Prolog Progr...
Sort
View
FORMATS
2004
Springer
14 years 1 months ago
Bounded Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
Fang Yu, Bow-Yaw Wang, Yao-Wen Huang
JMLR
2010
136views more  JMLR 2010»
13 years 2 months ago
High Dimensional Inverse Covariance Matrix Estimation via Linear Programming
This paper considers the problem of estimating a high dimensional inverse covariance matrix that can be well approximated by "sparse" matrices. Taking advantage of the c...
Ming Yuan
CSFW
2007
IEEE
13 years 11 months ago
Automaton-based Confidentiality Monitoring of Concurrent Programs
Noninterference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checking of noni...
Gurvan Le Guernic
ANLP
1994
155views more  ANLP 1994»
13 years 9 months ago
Guided Sentences Composition for Disabled People
We present the advantages of guided sentences composition for communicating in natural language with computers. We show how guidance can be achieved by means of the partial synthe...
Robert Pasero, Nathalie Richardet, Paul Sabatier
FOIKS
2008
Springer
13 years 9 months ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye