Foundational and Practical Aspects of Resource Analysis First International Workshop, FOPARA 2009, Eindhoven, The Netherlands, November 6, 2009, Revised Selected Papers /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Eekelen, Marko van (Επιμελητής έκδοσης), Shkaravska, Olha (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Lecture Notes in Computer Science, 6324
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02728nam a22005655i 4500
001 978-3-642-15331-0
003 DE-He213
005 20151116135808.0
007 cr nn 008mamaa
008 100907s2010 gw | s |||| 0|eng d
020 |a 9783642153310  |9 978-3-642-15331-0 
024 7 |a 10.1007/978-3-642-15331-0  |2 doi 
040 |d GrThAP 
050 4 |a QA76.758 
072 7 |a UMZ  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Foundational and Practical Aspects of Resource Analysis  |h [electronic resource] :  |b First International Workshop, FOPARA 2009, Eindhoven, The Netherlands, November 6, 2009, Revised Selected Papers /  |c edited by Marko van Eekelen, Olha Shkaravska. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a 170 p. 35 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6324 
505 0 |a FOPARA 2009 -- Comparing Cost Functions in Resource Analysis -- Improvements to a Resource Analysis for Hume -- A Space Consumption Analysis by Abstract Interpretation -- Global and Local Space Properties of Stream Programs -- Characterising Effective Resource Analyses for Parallel and Distributed Coordination -- Static Complexity Analysis of Higher Order Programs -- Derivational Complexity Is an Invariant Cost Model -- A Local Criterion for Polynomial-Time Stratified Computations -- Non-deterministic Boolean Proof Nets -- Polynomial Time Computation in the Context of Recursive Analysis. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computer programming. 
650 0 |a Software engineering. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 1 4 |a Computer Science. 
650 2 4 |a Software Engineering. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Programming Techniques. 
700 1 |a Eekelen, Marko van.  |e editor. 
700 1 |a Shkaravska, Olha.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642153303 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6324 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15331-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)