FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4302098687> ?p ?o ?g. }

• W4302098687 abstract "Synthesis is a particularly challenging problem for concurrent programs. At the same time it is a very promising approach, since concurrent programs are difficult to get right, or to analyze with traditional verification techniques. This paper gives an introduction to distributed synthesis in the setting of Mazurkiewicz traces, and its applications to decentralized runtime monitoring. 1 Context Modern computing systems are increasingly distributed and heterogeneous. Software needs to be able to exploit these advances, providing means for applications to be more performant. Traditional concurrent programming paradigms, as in Java, are based on threads, shared-memory, and locking mechanisms that guard access to common data. More recent paradigms like the reactive programming model of Erlang [4] and Scala [35,36] replace shared memory by asynchronous message passing, where sending a message is non-blocking. In all these concurrent frameworks, writing reliable software is a serious challenge. Programmers tend to think about code mostly in a sequential way, and it is hard to grasp all possible schedulings of events in a concurrent execution. For similar reasons, verification and analysis of concurrent programs is a difficult task. Testing, which is still the main method for error detection in software, has low coverage for concurrent programs. The reason is that bugs in such programs are difficult to reproduce: they may happen under very specific thread schedules and the likelihood of taking such corner-case schedules is very low. Automated verification, such as model-checking and other traditional exploration techniques, can handle very limited instances of concurrent programs, mostly because of the very large number of possible states and of possible interleavings of executions. Formal analysis of programs requires as a prerequisite a clean mathematical model for programs. Verification of sequential programs starts usually with an abstraction step -- reducing the value domains of variables to finite domains, viewing conditional branching as non-determinism, etc. Another major simplification consists in disallowing recursion. This leads to a very robust computational model, namely finite-state automata and regular languages. Regular languages of words (and trees) are particularly well understood notions. The deep connections between logic and automata revealed by the foundational work of Buchi, Rabin, and others, are the main ingredients in automata-based verification ." @default.
• W4302098687 created "2022-10-06" @default.
• W4302098687 creator A5044780614 @default.
• W4302098687 date "2015-06-08" @default.
• W4302098687 modified "2023-09-23" @default.
• W4302098687 title "Automated Synthesis of Distributed Controllers" @default.
• W4302098687 doi "https://doi.org/10.48550/arxiv.1506.02369" @default.
• W4302098687 hasPublicationYear "2015" @default.
• W4302098687 type Work @default.
• W4302098687 citedByCount "0" @default.
• W4302098687 crossrefType "posted-content" @default.
• W4302098687 hasAuthorship W4302098687A5044780614 @default.
• W4302098687 hasBestOaLocation W43020986871 @default.
• W4302098687 hasConcept C120314980 @default.
• W4302098687 hasConcept C138101251 @default.
• W4302098687 hasConcept C151319957 @default.
• W4302098687 hasConcept C193702766 @default.
• W4302098687 hasConcept C199360897 @default.
• W4302098687 hasConcept C31258907 @default.
• W4302098687 hasConcept C41008148 @default.
• W4302098687 hasConcept C42383842 @default.
• W4302098687 hasConcept C548217200 @default.
• W4302098687 hasConcept C82484044 @default.
• W4302098687 hasConceptScore W4302098687C120314980 @default.
• W4302098687 hasConceptScore W4302098687C138101251 @default.
• W4302098687 hasConceptScore W4302098687C151319957 @default.
• W4302098687 hasConceptScore W4302098687C193702766 @default.
• W4302098687 hasConceptScore W4302098687C199360897 @default.
• W4302098687 hasConceptScore W4302098687C31258907 @default.
• W4302098687 hasConceptScore W4302098687C41008148 @default.
• W4302098687 hasConceptScore W4302098687C42383842 @default.
• W4302098687 hasConceptScore W4302098687C548217200 @default.
• W4302098687 hasConceptScore W4302098687C82484044 @default.
• W4302098687 hasLocation W43020986871 @default.
• W4302098687 hasLocation W43020986872 @default.
• W4302098687 hasLocation W43020986873 @default.
• W4302098687 hasLocation W43020986874 @default.
• W4302098687 hasOpenAccess W4302098687 @default.
• W4302098687 hasPrimaryLocation W43020986871 @default.
• W4302098687 hasRelatedWork W1546517032 @default.
• W4302098687 hasRelatedWork W166880708 @default.
• W4302098687 hasRelatedWork W2097368307 @default.
• W4302098687 hasRelatedWork W2103949871 @default.
• W4302098687 hasRelatedWork W2130247694 @default.
• W4302098687 hasRelatedWork W2367613283 @default.
• W4302098687 hasRelatedWork W2521877348 @default.
• W4302098687 hasRelatedWork W2748403830 @default.
• W4302098687 hasRelatedWork W2922524015 @default.
• W4302098687 hasRelatedWork W4238882300 @default.
• W4302098687 isParatext "false" @default.
• W4302098687 isRetracted "false" @default.
• W4302098687 workType "article" @default.