Synthesis with privacy against an observer
From MaRDI portal
Publication:6629463
Cites work
- scientific article; zbMATH DE number 6527944 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 2086659 (Why is no real title available?)
- scientific article; zbMATH DE number 1444727 (Why is no real title available?)
- Algorithms for Omega-Regular Games with Imperfect Information
- Bounded Synthesis
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Deciding parity games in quasipolynomial time
- Energy parity games
- From linear time to branching time
- Graph Games and Reactive Synthesis
- On the (im)possibility of obfuscating programs
- Open Implication
- Reasoning about infinite computations
- Supervisory Control for Opacity
- Synthesis from LTL specifications with mean-payoff objectives
- Synthesis from hyperproperties
- Synthesis of obfuscation policies to ensure privacy and utility
- Synthesis of privacy-preserving systems
- Temporal synthesis for bounded systems and environments
- The complexity of two-player games of incomplete information
- The temporal semantics of concurrent programs
- Why These Automata Types?
This page was built for publication: Synthesis with privacy against an observer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629463)