Search Results for author:
Found 4 papers, 1 papers with code
Rational Verification for Probabilistic Systems
Rational verification is the problem of determining which temporal logic properties will hold in a multi-agent system, under the assumption that agents in the system act rationally, by choosing strategies that collectively form a game-theoretic equilibrium.
Learning Union of Integer Hypercubes with Queries (Technical Report)
In particular, a finite union of integer hypercubes correspond to a finite disjunction of monadic predicates over integer linear arithmetic (without modulo constraints).
Parameterized Synthesis with Safety Properties
Parameterized synthesis offers a solution to the problem of constructing correct and verified controllers for parameterized systems.
Logic in Computer Science Formal Languages and Automata Theory
String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version)
On the one hand, word equations (string logic with concatenations) cannot precisely capture sanitisation functions (e. g. htmlescape) and implicit browser transductions (e. g. innerHTML mutations).
Logic in Computer Science F.3.1
