Sciweavers

101 search results - page 7 / 21
» Error Correcting Analysis for Tree Languages
Sort
View
ACL
1993
13 years 8 months ago
Towards History-Based Grammars: Using Richer Models for Probabilistic Parsing
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
Ezra Black, Frederick Jelinek, John D. Lafferty, D...
SPIN
2009
Springer
14 years 2 months ago
Identifying Modeling Errors in Signatures by Model Checking
: Most intrusion detection systems deployed today apply misuse detection as analysis method. Misuse detection searches for attack traces in the recorded audit data using predefined...
Sebastian Schmerl, Michael Vogel, Hartmut Kön...
SIGSOFT
2008
ACM
14 years 8 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
ESOP
1999
Springer
13 years 11 months ago
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
Andreas Podelski, Witold Charatonik, Martin Mü...
PLILP
1992
Springer
13 years 11 months ago
Strictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
Mads Rosendahl