FOSSACS 2009 - PDF Preprint Papers

FOSSACS 2009 International Conference on Foundations of Software Science and Computation Structure

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOSSACS-2009 Paper

click to vote

FOSSACS
2009
Springer

221views Software Engineering» more FOSSACS 2009»

Facets of Synthesis: Revisiting Church's Problem

13 years 12 months ago

Download www-i7.informatik.rwth-aachen.de

In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...

Wolfgang Thomas

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	221	Facets of Synthesis: Revisiting Church's Problem	claim
2	169	On the Foundations of Quantitative Information Flow	claim
3	160	On Global Model Checking Trees Generated by Higher-Order Recursion Schemes	claim
4	158	Coalgebraic Hybrid Logic	claim
5	150	Beyond Shapes: Lists with Ordered Data	claim
6	143	The Calculus of Handshake Configurations	claim
7	142	Realizability of Concurrent Recursive Programs	claim
8	142	Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types	claim
9	136	Minimal Cost Reachability/Coverability in Priced Timed Petri Nets	claim
10	131	Delayed Nondeterminism in Continuous-Time Markov Decision Processes	claim
11	130	Bisimulation for Demonic Schedulers	claim
12	125	Cryptographic Protocol Composition via the Authentication Tests	claim
13	122	Dependency Tree Automata	claim
14	122	Separating Graph Logic from MSO	claim
15	106	Synthesis from Component Libraries	claim
16	105	On Omega-Languages Defined by Mean-Payoff Conditions	claim
17	103	Full Abstraction for Reduced ML	claim
18	101	A Kleene Theorem for Polynomial Coalgebras	claim
19	100	On the Expressive Power of Restriction and Priorities in CCS with Replication	claim
20	99	Least and Greatest Fixpoints in Game Semantics	claim
21	98	Logics and Bisimulation Games for Concurrency, Causality and Conflict	claim
22	96	Parameter Reduction in Grammar-Compressed Trees	claim
23	92	Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains	claim
24	88	Normal Bisimulations in Calculi with Passivation	claim
25	88	Interrupt Timed Automata	claim
26	84	Reactive Systems, Barbed Semantics, and the Mobile Ambients	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers