{"title":"Finitary fairness","authors":"R. Alur, T. Henzinger","doi":"10.1145/295656.295659","DOIUrl":"https://doi.org/10.1145/295656.295659","url":null,"abstract":"Fairness is a mathematical abstraction: in a multiprogramming environment, fairness abstracts the details of admissible (\"fair\") schedulers; in a distributed environment, fairness abstracts the speeds of independent processors. We argue that the standard definition of fairness often is unnecessarily weak and can be replaced by the stronger, yet still abstract, notion of finitary fairness. While standard weak fairness requires that no enabled transition is postponed forever, finitary weak fairness requires that for every run of a system there is an unknown bound k such that no enabled transition is postponed more than k consecutive times. In general, the finitary restriction fin(F) of any given fairness assumption F is the union of all w-regular safety properties that are contained in F. The adequacy of the proposed abstraction is demonstrated in two ways. Suppose that we prove a program property under the assumption of finitary fairness. In a multiprogramming environment, the program then satisfies the property for all fair finite-state schedulers. In a distributed environment, the program then satisfies the property for all choices of lower and upper bounds on the speeds (or timings) of processors.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117227971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Categories, allegories and circuit design","authors":"Carolyn Brown, G. Hutton","doi":"10.1109/LICS.1994.316052","DOIUrl":"https://doi.org/10.1109/LICS.1994.316052","url":null,"abstract":"Relational languages such as RUBY are used to derive hardware circuits from abstract specifications of their behaviour. Much reasoning is done informally in RUBY using pictorial representations of relational terms. We formalise this use of pictures in circuit design. We show that pictures naturally form a unitary pretabular allegory. Homomorphisms of pictures correspond to adding new wires or circuit comments. Two pictures are mutually homomorphic if and only if they represent equal allegorical terms. We prove soundness and completeness results which guarantee that deriving circuits using pictures does not lead to errors. We illustrate the use of pictures by deriving the ripple adder implementation from a high level, behavioural specification.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115585620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A compositional proof system for the modal /spl mu/-calculus","authors":"H. Andersen, C. Stirling, G. Winskel","doi":"10.1109/LICS.1994.316076","DOIUrl":"https://doi.org/10.1109/LICS.1994.316076","url":null,"abstract":"We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal /spl mu/-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal /spl mu/-calculus and combines it with techniques from work on local model checking. The proof system is sound for all processes and complete for a class of finite-state processes.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116839854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A syntactic characterization of NP-completeness","authors":"J. A. Medina, N. Immerman","doi":"10.1109/LICS.1994.316065","DOIUrl":"https://doi.org/10.1109/LICS.1994.316065","url":null,"abstract":"Fagin (1974) proved that NP is equal to the set of problems expressible in second-order existential logic (SO/spl exist/). We consider problems that are NP-complete via first-order projections (fops). These low-level reductions are known to have nice properties, including the fact that every pair of problems that are NP-complete via fops are isomorphic via a first-order definable isomorphism (E. Allender et al., 1993). However, before this paper, fewer than five natural problems had actually been shown to be NP-complete via fops. We give a necessary and sufficient syntactic condition for an SO/spl exist/ formula to represent a problem that is NP-complete via fops. Using this condition we prove syntactically that 29 natural NP-complete problems remain complete via fops.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123385603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Paths in the lambda-calculus. Three years of communications without understanding","authors":"A. Asperti, V. Danos, C. Laneve, L. Regnier","doi":"10.1109/LICS.1994.316048","DOIUrl":"https://doi.org/10.1109/LICS.1994.316048","url":null,"abstract":"Since the rebirth of /spl lambda/-calculus in the late 1960s, three major theoretical investigations of /spl beta/-reduction have been undertaken: (1) Levy's (1978) analysis of families of redexes (and the associated concept of labeled reductions); (2) Lamping's (1990) graph-reduction algorithm; and (3) Girard's (1988) geometry of interaction. All three studies happened to make crucial (if not always explicit) use of the notion of a path, namely and respectively: legal paths, consistent paths and regular paths. We prove that these are equivalent to each other.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient inference of object types","authors":"J. Palsberg","doi":"10.1109/LICS.1994.316073","DOIUrl":"https://doi.org/10.1109/LICS.1994.316073","url":null,"abstract":"Abadi and Cardelli (1994) have investigated a calculus of objects. The calculus supports a key feature of object-oriented languages: an object can be emulated by another object that has more refined methods. Abadi and Cardelli presented four first-order type systems for the calculus. The simplest one is based on finite types and no subtyping, and the most powerful one has both recursive types and subtyping. Open until now is the question of type inference, and in the presence of subtyping \"the absence of minimum typings poses practical problems for type inference\". In this paper we give an O(n/sup 3/) algorithm for each of the four type inference problems and we prove that all the problems are P-complete.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125599821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Subtyping and parametricity","authors":"G. Plotkin, M. Abadi, L. Cardelli","doi":"10.1109/LICS.1994.316058","DOIUrl":"https://doi.org/10.1109/LICS.1994.316058","url":null,"abstract":"We study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic supports the formal definition and use of relational parametricity. We give two models for it, and compare it with other formal systems for the same language. In particular we examine the \"Penn interpretation\" of subtyping as implicit coercion. without subtyping, parametricity yields, for example, an encoding of abstract types and of initial algebras, with the corresponding proof principles of simulation and induction. With subtyping, we obtain partially abstract types and certain initial order-sorted algebras, and may derive proof principles for them.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125200793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A general semantics for Evaluation Logic","authors":"E. Moggi","doi":"10.1109/LICS.1994.316054","DOIUrl":"https://doi.org/10.1109/LICS.1994.316054","url":null,"abstract":"The semantics of Evaluation Logic proposed by Moggi (1994) relies on additional properties of monads. This paper proposes an alternative semantics, which drops all additional requirement on monads at the expense of stronger assumptions on the underlying category. These assumptions are satisfied by any topos, but not by the category of cpos. However, in the setting of Synthetic Domain Theory (J. Hyland, 1991) and (P.Taylor, 1991) it is possible to reconcile the needs of denotational semantics with those of logic.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117214176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"McColm's conjecture [positive elementary inductions]","authors":"Y. Gurevich, N. Immerman, S. Shelah","doi":"10.1109/LICS.1994.316091","DOIUrl":"https://doi.org/10.1109/LICS.1994.316091","url":null,"abstract":"G. McColm (1990) conjectured that positive elementary inductions are bounded in a class K of finite structures if every (FO+LFP) formula is equivalent to a first-order formula in K. Here (FO+LFP) is the extension of first-order logic with the least fixed point operator. We disprove the conjecture. Our main results are two model-theoretic constructions, one deterministic and the other randomized, each of which refutes McColm's conjecture.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128184314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Type inference and extensionality","authors":"A. Piperno, S. D. Rocca","doi":"10.1109/LICS.1994.316072","DOIUrl":"https://doi.org/10.1109/LICS.1994.316072","url":null,"abstract":"The polymorphic type assignment system F/sub 2/ is the type assignment counterpart of Girard's and Reynolds' (1972) system F. Though introduced in the early seventies, both the type inference and the type checking problems for F/sub 2/ remained open for a long time. Recently, an undecidability result was announced. Consequently, it is considerably interesting to find decidable restrictions of the system. We show a bounded type inference and a bounded type checking algorithm, both based on the study of the relationship between the typability of a term and the typability of terms that \"properly\" /spl eta/-reduce to it.<<ETX>>","PeriodicalId":302290,"journal":{"name":"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129134419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}