Provenfix: Temporal property-guided program repair
Model checking has been used traditionally for finding violations of temporal properties.
Recently, testing or fuzzing approaches have also been applied to software systems to find …
Recently, testing or fuzzing approaches have also been applied to software systems to find …
Comparing molecular patterns using the example of SMARTS: theory and algorithms
R Schmidt, ESR Ehmki, F Ohm, HC Ehrlich… - Journal of Chemical …, 2019 - ACS Publications
Molecular patterns are widely used for compound filtering in molecular design endeavors.
They describe structural properties that are connected with unwanted physical or chemical …
They describe structural properties that are connected with unwanted physical or chemical …
Precise and scalable static analysis of jQuery using a regular expression domain
jQuery is the most popular JavaScript library but the state-of-the-art static analyzers for
JavaScript applications fail to analyze simple programs that use jQuery. In this paper, we …
JavaScript applications fail to analyze simple programs that use jQuery. In this paper, we …
Automated Temporal Verification for Algebraic Effects
Although effect handlers offer a versatile abstraction for user-defined effects, they produce
complex and less restricted execution traces due to the composable non-local control flow …
complex and less restricted execution traces due to the composable non-local control flow …
From finite automata to regular expressions and back—a summary on descriptional complexity
H Gruber, M Holzer - … Journal of Foundations of Computer Science, 2015 - World Scientific
The equivalence of finite automata and regular expressions dates back to the seminal paper
of Kleene on events in nerve nets and finite automata from 1956. In the present paper we …
of Kleene on events in nerve nets and finite automata from 1956. In the present paper we …
Constrained Decoding for Code Language Models via Efficient Left and Right Quotienting of Context-Sensitive Grammars
Large Language Models are powerful tools for program synthesis and advanced auto-
completion, but come with no guarantee that their output code is syntactically correct. This …
completion, but come with no guarantee that their output code is syntactically correct. This …
A synchronous effects logic for temporal verification of pure esterel
Esterel is an imperative synchronous language that has found success in many safety-
critical applications. Its precise semantics makes it natural for programming and reasoning …
critical applications. Its precise semantics makes it natural for programming and reasoning …
[HTML][HTML] Abstract execution: automatically proving infinitely many programs
D Steinhöfel - 2020 - tubiblio.ulb.tu-darmstadt.de
Abstract programs contain schematic placeholders representing potentially infinitely many
concrete programs. They naturally occur in multiple areas of computer science concerned …
concrete programs. They naturally occur in multiple areas of computer science concerned …
Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for
XML manipulation languages. XML applications would benefit from the extension of REs …
XML manipulation languages. XML applications would benefit from the extension of REs …
[HTML][HTML] Inclusion algorithms for one-unambiguous regular expressions and their applications
One-unambiguous regular expressions are used in DTD and XML Schema. It is known that
inclusion for one-unambiguous regular expressions is in PTIME. However, there has been …
inclusion for one-unambiguous regular expressions is in PTIME. However, there has been …