SMT-based synthesis of distributed systems
Proceedings of the second workshop on Automated formal methods
Distributed synthesis for well-connected architectures
Formal Methods in System Design
Synthesis of Fault-Tolerant Distributed Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Synthesis of asynchronous systems
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Distributed synthesis for alternating-time logics
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Taming distributed asynchronous systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A communication based model for games of imperfect information
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Does it pay to extend the perimeter of a world model?
FM'11 Proceedings of the 17th international conference on Formal methods
Synthesis of distributed control through knowledge accumulation
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Distributed synthesis for regular and contextfree specifications
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The buck stops here: order, chance, and coordination in distributed control
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Distributed synthesis for well-connected architectures
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Semi-automatic distributed synthesis
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Satisfiability and finite model property for the alternating-time µ-calculus
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On distributed program specification and synthesis in architectures with cycles
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Synthesis for probabilistic environments
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Decidability of well-connectedness for distributed synthesis
Information Processing Letters
Fair Synthesis for Asynchronous Distributed Systems
ACM Transactions on Computational Logic (TOCL)
Asynchronous games over tree architectures
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Distributed synthesis is simply undecidable
Information Processing Letters
| Hi-index | 0.00 |
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated ...