Comparing the Precision of Abstract Operators in the eBPF Verifier Using Differential Synthesis
Abstract elided by the publisher.
26,098 papers · page 83 of 1,305
Specifying and Verifying Future Conditions
Abstract elided by the publisher.
Abstracting Concolic Execution for Soft Contract Verification
Abstract elided by the publisher.
Monarch: A Modular Framework for Abstract Definitional Interpreters in Haskell
Abstract elided by the publisher.
Enhancing Neural Network Robustness via Synthesis of Repair Programs
Abstract elided by the publisher.
Bounded-Exhaustive Subspace Diversification for SMT Solver Testing
Abstract elided by the publisher.
Dynamic Dependency-Based Purity Checking
Many software language tools use declarative domain-specific languages (DDSLs) to implement parts of their functionality, such as context-free grammars for parsing or inference rules for type analysis. For interoperability and ease of use, DDSLs often rely on embedded general-pur…
A New DSL Textbook in Town!
DSLs are the ultimate abstraction in software engineering. While programming languages have --- since the advent of computers --- continuously increased their level of abstraction, they are still limited to the domain of computing, with their instances containing many technicalit…
Scheduling the Construction and Interrogation of Scope Graphs Using Attribute Grammars
Recognizing that name binding is often done in an ad-hoc manner, Visser and his colleagues introduced scope graphs as a uniform representation of a program's static binding structure along with a generic means for interrogating that representation to resolve name references to th…
Boosting Parallel Parsing through Cyclic Operator Precedence Grammars
Deterministic parsing of tree-structured data is usually performed sequentially left-to-right. Recently however, also motivated by the need to process extremely large data sets, a parallel version thereof has been devised which, thanks to the theoretical features of operator prec…
Variability Fault Localization by Abstract Interpretation and its Application to SPL Repair
Fault localization is an important step in software debugging that aims to isolate and localize the bugs (errors) to a small part of the program. This becomes more challenging in Software Product Lines (SPLs) due to the variable nature of bugs (so-called variability bugs). This p…
Integrating Model Checking into a Live Modeling Environment
Live modeling is the ability to change an executable model at runtime, and without having to restart its execution. Sometimes this 'breaks' the ongoing execution, but in many cases, it does not have to. In earlier work, we reduced this problem to detecting fine-grained read/write…
TranspileJS, an Intelligent Framework for Transpiling JavaScript to WebAssembly
WebAssembly (Wasm) has emerged as a powerful binary format, enabling the seamless integration of languages like C and Rust into web applications. JavaScript (JS), the dominant language for client-side web development, has its code susceptible to tampering and intellectual propert…
Exploratory, Omniscient, and Multiverse Diagnostics in Debuggers for Non-Deterministic Languages
Debugging non-deterministic programs is inherently difficult as the compound effects of non-deterministic execution steps is hard to predict and gives rise to a (potentially) vast space of reachable program states such that manual exploration of all reachable states is infeasible…
Optimize Effect Handling for Tail-resumption with Stack Unwinding
Algebraic effect handling is a superior abstraction for non-local control flows, unifying over the existing non-local control flow constructs such as try/catch, destructors, shared state, async/await and generators. To encourage the adoption of effect handlers, improving their pe…
A Model-Driven Approach to Design, Generation, and Deployment of GUI Component Libraries
The reusability of modular, embeddable components is a key determinant for the success of modern programming languages to ensure efficient and high-quality development. However, there is a gap in the field of domain-specific modeling regarding reusable components at the model lev…
(Semantic) Feature Model Differences with (Q)SAT
Feature models evolve in multiple iterations over time. When modellers change a model, they enact syntactical changes in order to produce specific semantic differences between model iterations. Many tools have been developed to analyze such syntactical differences, but the changi…
AnyText: Incremental, left-recursive Parsing and Pretty-Printing from a single Grammar Definition with first-class LSP support
Many current language workbenches do not support incremental parsing or left recursion, lack support for resolving references and pretty-printing or make it difficult to implement the Language Server Protocol (LSP) based on the generated parser. In this paper, we present AnyText,…
Lessons Learned from Developing the MontiCore Language Workbench: Challenges of Modular Language Design
In software language engineering, composition and modular design are essential milestones to advance reuse in this domain. Although language engineering improves quality and development efficiency by incorporating reusable components and tooling, some disadvantages and limitation…
Property-based Testing of Attribute Grammars
Software testing is an integral part of modern software development. Testing frameworks are part of the toolset of any software language allowing programmers to test their programs in order to detect bugs. Unfortunately, there is no work on testing in attribute grammars. In this…