[{"page":"1 - 165","date_published":"2003-03-31T00:00:00Z","extern":1,"status":"public","main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/lampert-phd2003.pdf","open_access":"0"}],"type":"dissertation","quality_controlled":0,"publication_status":"published","intvolume":" 356","publication":"Bonner Mathematische Schriften","year":"2003","publisher":"Universität Bonn, Fachbibliothek Mathematik","volume":356,"date_updated":"2021-01-12T07:45:05Z","date_created":"2018-12-11T12:04:34Z","day":"31","_id":"3678","publist_id":"2704","citation":{"ieee":"C. Lampert, “The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ,” Universität Bonn, Fachbibliothek Mathematik, 2003.","ista":"Lampert C. 2003. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Universität Bonn, Fachbibliothek Mathematik.","apa":"Lampert, C. (2003). *The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric *. *Bonner Mathematische Schriften*. Universität Bonn, Fachbibliothek Mathematik.","mla":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” *Bonner Mathematische Schriften*, vol. 356, Universität Bonn, Fachbibliothek Mathematik, 2003, pp. 1–165.","ama":"Lampert C. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . *Bonner Mathematische Schriften*. 2003;356:1-165.","short":"C. Lampert, The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric , Universität Bonn, Fachbibliothek Mathematik, 2003.","chicago":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” *Bonner Mathematische Schriften*. Universität Bonn, Fachbibliothek Mathematik, 2003."},"title":"The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ","author":[{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Christoph Lampert","orcid":"0000-0001-8622-7887"}],"month":"03"},{"title":"Symbolic algorithms for verification and control","abstract":[{"text":"Methods for the formal specification and verification of systems are indispensible for the development of complex yet correct systems. In formal verification, the designer describes the system in a modeling language with a well-defined semantics, and this system description is analyzed against a set of correctness requirements. Model checking is an algorithmic technique to check that a system description indeed satisfies correctness requirements given as logical specifications. While successful in hardware verification, the potential for model checking for software and embedded systems has not yet been realized. This is because traditional model checking focuses on systems modeled as finite state-transition graphs. While a natural model for hardware (especially synchronous hardware), state-transition graphs often do not capture software and embedded systems at an appropriate level of granularity. This dissertation considers two orthogonal extensions to finite state-transition graphs making model checking techniques applicable to both a wider class of systems and a wider class of properties.\r\n\r\nThe first direction is an extension to infinite-state structures finitely represented using constraints and operations on constraints. Infinite state arises when we wish to model variables with unbounded range (e.g., integers), or data structures, or real time. We provide a uniform framework of symbolic region algebras to study model checking of infinite-state systems. We also provide sufficient language-independent termination conditions for symbolic model checking algorithms on infinite state systems.\r\n\r\nThe second direction supplements verification with game theoretic reasoning. Games are natural models for interactions between components. We study game theoretic behavior with winning conditions given by temporal logic objectives both in the deterministic and in the probabilistic context. For deterministic games, we provide an extremal model characterization of fixpoint algorithms that link solutions of verification problems to solutions for games. For probabilistic games we study fixpoint characterization of winning probabilities for games with omega-regular winning objectives, and construct (epsilon-)optimal winning strategies.","lang":"eng"}],"author":[{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"month":"12","supervisor":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"citation":{"ieee":"R. Majumdar, “Symbolic algorithms for verification and control,” University of California, Berkeley, 2003.","ista":"Majumdar R. 2003. Symbolic algorithms for verification and control. University of California, Berkeley.","apa":"Majumdar, R. (2003). *Symbolic algorithms for verification and control*. University of California, Berkeley.","chicago":"Majumdar, Ritankar. “Symbolic Algorithms for Verification and Control.” University of California, Berkeley, 2003.","short":"R. Majumdar, Symbolic Algorithms for Verification and Control, University of California, Berkeley, 2003.","mla":"Majumdar, Ritankar. *Symbolic Algorithms for Verification and Control*. University of California, Berkeley, 2003, pp. 1–201.","ama":"Majumdar R. Symbolic algorithms for verification and control. 2003:1-201."},"date_created":"2018-12-11T12:08:44Z","publist_id":"313","_id":"4416","day":"01","language":[{"iso":"eng"}],"year":"2003","publication_status":"published","article_processing_charge":"No","date_updated":"2021-01-12T07:56:49Z","publisher":"University of California, Berkeley","oa_version":"None","extern":"1","status":"public","page":"1 - 201","date_published":"2003-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"dissertation"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"dissertation","extern":"1","status":"public","date_published":"2003-10-01T00:00:00Z","page":"1 - 237","article_processing_charge":"No","date_updated":"2021-01-12T07:56:53Z","oa_version":"None","publisher":"University of California, Berkeley","year":"2003","language":[{"iso":"eng"}],"publication_status":"published","citation":{"mla":"Horowitz, Benjamin. *Giotto: A Time-Triggered Language for Embedded Programming*. University of California, Berkeley, 2003, pp. 1–237.","ama":"Horowitz B. Giotto: A time-triggered language for embedded programming. 2003:1-237.","short":"B. Horowitz, Giotto: A Time-Triggered Language for Embedded Programming, University of California, Berkeley, 2003.","chicago":"Horowitz, Benjamin. “Giotto: A Time-Triggered Language for Embedded Programming.” University of California, Berkeley, 2003.","apa":"Horowitz, B. (2003). *Giotto: A time-triggered language for embedded programming*. University of California, Berkeley.","ieee":"B. Horowitz, “Giotto: A time-triggered language for embedded programming,” University of California, Berkeley, 2003.","ista":"Horowitz B. 2003. Giotto: A time-triggered language for embedded programming. University of California, Berkeley."},"_id":"4425","day":"01","publist_id":"305","date_created":"2018-12-11T12:08:47Z","supervisor":[{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"author":[{"first_name":"Benjamin","full_name":"Horowitz, Benjamin","last_name":"Horowitz"}],"month":"10","abstract":[{"text":"Giotto provides a time-triggered programmer’s model for the implementation of embedded control systems with hard real-time constraints. Giotto’s precise semantics and predictabil- ity make it suitable for safety-critical applications.\r\nGiotto is based around the idea that time-triggered task invocation together with time-triggered mode switching can form a useful programming model for real-time systems. To substantiate this claim, we describe the use of Giotto to refactor the software of a small, autonomous helicopter. The ease with which Giotto expresses the existing software provides evidence that Giotto is an appropriate programming language for control systems.\r\nSince Giotto is a real-time programming language, ensuring that Giotto programs meet their deadlines is crucial. To study precedence-constrained Giotto scheduling, we first examine single-mode, single-processor scheduling. We extend to an infinite, periodic setting the classical problem of meeting deadlines for a set of tasks with release times, deadlines, precedence constraints, and preemption. We then develop an algorithm for scheduling Giotto programs on a single processor by representing Giotto programs as instances of the extended scheduling problem.\r\nNext, we study multi-mode, single-processor Giotto scheduling. This problem is different from classical scheduling problems, since in our precedence-constrained approach, the deadlines of tasks may vary depending on the mode switching behavior of the program. We present conditional scheduling models which capture this varying-deadline behavior. We develop polynomial-time algorithms for some conditional scheduling models, and prove oth- ers to be computationally hard. We show how to represent multi-mode Giotto programs as instances of the model, resulting in an algorithm for scheduling multi-mode Giotto programs on a single processor.\r\nFinally, we show that the problem of scheduling Giotto programs for multiple net- worked processors is strongly NP-hard.","lang":"eng"}],"title":"Giotto: A time-triggered language for embedded programming"},{"page":"1 - 116","date_published":"2002-05-01T00:00:00Z","status":"public","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"dissertation","publication_status":"published","year":"2002","language":[{"iso":"eng"}],"oa_version":"None","publisher":"University of California, Berkeley","article_processing_charge":"No","date_updated":"2021-01-12T07:56:48Z","day":"01","_id":"4414","publist_id":"315","date_created":"2018-12-11T12:08:44Z","citation":{"apa":"Mang, F. (2002). *Games in open systems verification and synthesis*. University of California, Berkeley.","short":"F. Mang, Games in Open Systems Verification and Synthesis, University of California, Berkeley, 2002.","chicago":"Mang, Freddy. “Games in Open Systems Verification and Synthesis.” University of California, Berkeley, 2002.","mla":"Mang, Freddy. *Games in Open Systems Verification and Synthesis*. University of California, Berkeley, 2002, pp. 1–116.","ama":"Mang F. Games in open systems verification and synthesis. 2002:1-116.","ista":"Mang F. 2002. Games in open systems verification and synthesis. University of California, Berkeley.","ieee":"F. Mang, “Games in open systems verification and synthesis,” University of California, Berkeley, 2002."},"abstract":[{"lang":"eng","text":"This dissertation investigates game-theoretic approaches to the algorithmic analysis of concurrent, reactive systems. A concurrent system comprises a number of components working concurrently; a reactive system maintains an ongoing interaction with its environment. Traditional approaches to the formal analysis of concurrent reactive systems usually view the system as an unstructured state-transition graphs; instead, we view them as collections of interacting components, where each one is an open system which accepts inputs from the other components. The interactions among the components are naturally modeled as games.\r\n\r\nAdopting this game-theoretic view, we study three related problems pertaining to the verification and synthesis of systems. Firstly, we propose two novel game-theoretic techniques for the model-checking of concurrent reactive systems, and improve the performance of model-checking. The first technique discovers an error as soon as it cannot be prevented, which can be long before it actually occurs. This technique is based on the key observation that "unpreventability" is a local property to a module: an error is unpreventable in a module state if no environment can prevent it. The second technique attempts to decompose a model-checking proof into smaller proof obligations by constructing abstract modules automatically, using reachability and "unpreventability" information about the concrete modules. Three increasingly powerful proof decomposition rules are proposed and we show that in practice, the resulting abstract modules are often significantly smaller than the concrete modules and can drastically reduce the space and time requirements for verification. Both techniques fall into the category of compositional reasoning.\r\n\r\nSecondly, we investigate the composition and control of synchronous systems. An essential property of synchronous systems for compositional reasoning is non-blocking. In the composition of synchronous systems, however, due to circular causal dependency of input and output signals, non-blocking is not always guaranteed. Blocking compositions of systems can be ruled out semantically, by insisting on the existence of certain fixed points, or syntactically, by equipping systems with types, which make the dependencies between input and output signals transparent. We characterize various typing mechanisms in game-theoretic terms, and study their effects on the controller synthesis problem. We show that our typing systems are general enough to capture interesting real-life synchronous systems such as all delay-insensitive digital circuits. We then study their corresponding single-step control problems --a restricted form of controller synthesis problem whose solutions can be iterated in appropriate manners to solve all LTL controller synthesis problems. We also consider versions of the controller synthesis problem in which the type of the controller is given. We show that the solution of these fixed-type control problems requires the evaluation of partially ordered (Henkin) quantifiers on boolean formulas, and is therefore harder (nondeterministic exponential time) than more traditional control questions.\r\n\r\nThirdly, we study the synthesis of a class of open systems, namely, uninitialized state machines. The sequential synthesis problem, which is closely related to Church's solvability problem, asks, given a specification in the form of a binary relation between input and output streams, for the construction of a finite-state stream transducer that converts inputs to appropriate outputs. For efficiency reasons, practical sequential hardware is often designed to operate without prior initialization. Such hardware designs can be modeled by uninitialized state machines, which are required to satisfy their specification if started from any state. We solve the sequential synthesis problem for uninitialized systems, that is, we construct uninitialized finite-state stream transducers. We consider specifications given by LTL formulas, deterministic, nondeterministic, universal, and alternating Buechi automata. We solve this uninitialized synthesis problem by reducing it to the well-understood initialized synthesis problem. While our solution is straightforward, it leads, for some specification formalisms, to upper bounds that are exponentially worse than the complexity of the corresponding initialized problems. However, we prove lower bounds to show that our simple solutions are optimal for all considered specification formalisms. The lower bound proofs require nontrivial generic reductions."}],"title":"Games in open systems verification and synthesis","supervisor":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"author":[{"first_name":"Freddy","last_name":"Mang","full_name":"Mang, Freddy"}],"month":"05"},{"title":"Algorithms and Methodology for Scalable Model Checking","abstract":[{"text":"Model checking algorithms for the verification of reactive systems proceed by a systematic and exhaustive exploration of the system state space. They do not scale to large designs because of the state explosion problem --the number of states grows exponentially with the number of components in the design. Consequently, the model checking problem is PSPACE-hard in the size of the design description. This dissertation proposes three novel techniques to combat the state explosion problem.\r\n\r\nOne of the most important advances in model checking in recent years has been the discovery of symbolic methods, which use a calculus of expressions, such as binary decision diagrams, to represent the state sets encountered during state space exploration. Symbolic model checking has proved to be effective for verifying hardware designs. Traditionally, symbolic checking of temporal logic specifications is performed by backward fixpoint reasoning with the operator Pre. Backward reasoning can be wasteful since unreachable states are explored. We suggest the use of forward fixpoint reasoning based on the operator Post. We show how all linear temporal logic specifications can be model checked symbolically by forward reasoning. In contrast to backward reasoning, forward reasoning performs computations only on the reachable states.\r\n\r\nHeuristics that improve algorithms for application domains, such as symbolic methods for hardware designs, are useful but not enough to make model checking feasible on industrial designs. Currently, exhaustive state exploration is possible only on designs with about 50-100 boolean state variables. Assume-guarantee verification attempts to combat the state explosion problem by using the principle of "divide and conquer," where the components of the implementation are analyzed one at a time. Typically, an implementation component refines its specification only when its inputs are suitably constrained by other components in the implementation. The assume-guarantee principle states that instead of constraining the inputs by implementation components, it is sound to constrain them by the corresponding specification components, which can be significantly smaller. We extend the assume-guarantee proof rule to deal with the case where the specification operates at a coarser time scale than the implementation. Using our model checker Mocha, which implements this methodology, we verify VGI, a parallel DSP processor chip with 64 compute processors each containing approximately 800 state variables and 30K gates.\r\n\r\nOur third contribution is a systematic model checking methodology for verifying the abstract shared-memory interface of sequential consistency on multiprocessor systems with three parameters --number of processors, number of memory locations, and number of data values. Sequential consistency requires that some interleaving of the local temporal orders of read/write events at different processors be a trace of serial memory. Therefore, it suffices to construct a non-interfering serializer that watches and reorders read/write events so that a trace of serial memory is obtained. While in general such a serializer must be unbounded even for fixed values of the parameters --checking sequential consistency is undecidable!-- we show that the paradigmatic class of snoopy cache coherence protocols has finite-state serializers. In order to reduce the arbitrary-parameter problem to the fixed-parameter problem, we develop a novel framework for induction over the number of processors and use the notion of a serializer to reduce the problem of verifying sequential consistency to that of checking language inclusion between finite state machines.","lang":"eng"}],"author":[{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"}],"month":"10","supervisor":[{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bryton","full_name":"Bryton, Robert","first_name":"Robert"},{"last_name":"Steel","full_name":"Steel, John","first_name":"John"}],"date_created":"2018-12-11T12:08:43Z","_id":"4411","publist_id":"321","day":"01","citation":{"ieee":"S. Qadeer, “Algorithms and Methodology for Scalable Model Checking,” University of California, Berkeley, 1999.","ista":"Qadeer S. 1999. Algorithms and Methodology for Scalable Model Checking. University of California, Berkeley.","apa":"Qadeer, S. (1999). *Algorithms and Methodology for Scalable Model Checking*. University of California, Berkeley.","mla":"Qadeer, Shaz. *Algorithms and Methodology for Scalable Model Checking*. University of California, Berkeley, 1999, pp. 1–150.","ama":"Qadeer S. Algorithms and Methodology for Scalable Model Checking. 1999:1-150.","chicago":"Qadeer, Shaz. “Algorithms and Methodology for Scalable Model Checking.” University of California, Berkeley, 1999.","short":"S. Qadeer, Algorithms and Methodology for Scalable Model Checking, University of California, Berkeley, 1999."},"publication_status":"published","language":[{"iso":"eng"}],"year":"1999","publisher":"University of California, Berkeley","oa_version":"None","article_processing_charge":"No","date_updated":"2021-01-12T07:56:47Z","page":"1 - 150","date_published":"1999-10-01T00:00:00Z","status":"public","extern":"1","main_file_link":[{"url":"http://mtc.epfl.ch/~tah/Students/qadeer.pdf"}],"type":"dissertation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]