Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata, Languages and Programming [[electronic resource] ] : 10th Colloquium Barcelona, Spain, July 18–22, 1983 / / edited by J. Diaz
| Automata, Languages and Programming [[electronic resource] ] : 10th Colloquium Barcelona, Spain, July 18–22, 1983 / / edited by J. Diaz |
| Edizione | [1st ed. 1983.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 |
| Descrizione fisica | 1 online resource (VIII, 737 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Mathematical logic Computer programming Computation by Abstract Devices Mathematical Logic and Formal Languages Programming Techniques |
| ISBN | 3-540-40038-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On semantic foundations for applicative multiprogramming -- An axiomatization of the intermittent assertion method using temporal logic -- Topological characterizations of infinite behaviours of transition systems -- Linear time and branching time semantics for recursion with merge -- Processes and a fair semantics for the ADA rendez-vous -- Conditional dependencies for horizontal decompositions -- On the relationship of CCS and CSP -- Behavioural equivalence relations induced by programming logics -- Lower bounds for constant depth circuits for prefix problems -- Test sets for morphisms with bounded delay -- Symmetric and economical solutions to the mutual exclusion problem in a distributed system -- Ambiguity and decision problems concerning number systems -- On the observational semantics of fair parallelism -- An O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching -- Algebraic languages and polyomnoes enumeration -- On the number of equal-sized semispaces of a set of points in the plane -- Algebraic specifications with generating constraints -- Wythoff games, continued fractions, cedar trees and Fibonacci searches -- Initial index: A new complexity function for languages -- Modular compiler descriptions based on abstract semantic data types (Extended Abstract) -- Polynomial-time factorization of multivariate polynomials over finite fields -- Processes of place/transition-nets -- A hardware semantics based on temporal intervals -- Lower bounds for solving undirected graph problems on VLSI -- Concurrent probabilistic program, or: How to schedule if you must -- Computation times of NP sets of different densities -- Rewrite methods for clausal and non-clausal theorem proving -- Complexity of infinite trees -- Incremental construction of unification algorithms in equational theories -- Tree automata and attribute grammars -- Effectively given spaces -- A note on intersections of free submonoids of a free monoid -- A fast sorting algorithm for VLSI -- On the composition of morphisms and inverse morphisms -- On the group complexity of a finite language -- Reasoning with time and chance -- Factoring multivariate integral polynomials -- On the study data structures: Binary tournaments with repeated keys -- Minimizing width in linear layouts -- Proving precedence properties: The temporal way -- An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language -- Searchability in merging and implicit data structures -- Strong abstract interpretation using power domains -- Testing equivalences for processes -- Specification-oriented semantics for communicating processes -- Complexity classes of alternating machines with oracles -- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots -- Parallel dictionaries on 2–3 trees -- Varietes de semigroupes et mots infinis -- Arbres et hierarchies de concatenation -- A multiprocess network logic with temporal and spatial modalities -- Enumeration of success patterns in logic programs -- Immunity -- Power domains and predicate transformers: A topological view -- Recognition and isomorphism of two dimensional partial orders -- On the simulation of many storage heads by a single one -- Synchronisation trees -- Cutting and partitioning a graph after a fixed pattern -- Context-free controlled etol systems -- Referees for ICALP-83. |
| Record Nr. | UNISA-996466335803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formalization of Programming Concepts [[electronic resource] ] : International Colloquium, Peniscola, Spain, April 19-25, 1981. Proceedings / / edited by J. Diaz, I. Ramos
| Formalization of Programming Concepts [[electronic resource] ] : International Colloquium, Peniscola, Spain, April 19-25, 1981. Proceedings / / edited by J. Diaz, I. Ramos |
| Edizione | [1st ed. 1981.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981 |
| Descrizione fisica | 1 online resource (X, 486 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Software Engineering/Programming and Operating Systems Programming Techniques |
| ISBN | 3-540-38654-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The algebra of functional programs: Function level reasoning, linear equations, and extended definitions -- The VDM principles of software specification & program design -- Attribute grammars : Theory and applications -- Compiler generation from formal definition of programming languages : A survey -- Formal behavioural specification of concurrent systems without globality assumptions -- A birkhoff-like theorem for algebraic classes of interpretations of program schemes -- Building data base management systems through formal specification -- Reducing types in applicative languages with structured data -- On the definition of lambda-calculus models -- About data type genericity -- On the algebraic extensions of abstract data types -- Scenarios: A model of non-determinate computation -- An operational semantics for a language with early completion data structures -- Le calcul des fermetures dans les lambda-langages -- Distributed termination with interval assertions -- Algebraic denotational semantics using parameterized abstract modules -- Relational semantics of strongly communicating sequential processes -- A construction of concurrent systems by means of sequential solutions and concurrency relations -- The development of an interpreter by means of abstract algebraic software specifications -- A formal model of an interpreter for nonprocedural languages -- Proof theoretic methodology for propositional dynamic logic -- FP systems in edinburgh LCF -- A proposal for operational semantics and equivalence of finite asynchronous processes -- An extension to horn clause logic allowing the definition of concurrent processes -- A semantic algebra for binding constructs -- On the representation of data types -- An approach to communications and parallelism in applicative languages -- Using least fixed points to characterize formal computations of non-deterministic equations -- Formal representations for recursively defined functional programs -- Petri nets and concurrency-like relations. |
| Record Nr. | UNISA-996465509403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||