Picture of an eye scanning technical data.

Open Access research that improves the lives of children and families...

Strathprints makes available scholarly Open Access content by scholars in the School of Social Work & Social Policy, based within the Faculty of Humanities & Social Sciences (HaSS) .

Research at Social Work & Social Policy seeks to understand the social experiences of children, young people and families, in order to support evidence-informed policy. Issues of public health, health inequalities and health history within the context of social work are also important research themes. Research centres, such as CELCIS (Centre for Excellence for Children's Care & Protection) and the CYCJ (Centre for Youth & Criminal Justice) operate in furtherance of these research areas, supporting evidence-based solutions to improve child wellbeing and improvements in youth justice, and the lives of families and communities.

Explore the Open Access research of Social Work & Social Policy. Or explore all of Strathclyde's Open Access research...

Browse by Journal or other publication

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Publication Date | Item type | No Grouping
Jump to: 2018 | 2017 | 2015 | 2012 | 2011 | 2009 | 2008
Number of items: 15.

2018

Hansen, Mikkel and Larsen, Kim Guldstrand and Mardare, Radu and Pedersen, Mathias Ruggaard (2018) Reasoning about bounds in weighted transition systems. Logical Methods in Computer Science, 14 (4). 19. ISSN 1860-5974

Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim G. and Mardare, Radu (2018) A complete quantitative deduction system for the bisimilarity distance on Markov chains. Logical Methods in Computer Science, 14 (4). 15. ISSN 1860-5974

Mardare, Radu and Panangaden, Prakash and Plotkin, Gordon D. (2018) Free complete Wasserstein algebras. Logical Methods in Computer Science, 14 (3). 19. ISSN 1860-5974

2017

Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim G. and Mardare, Radu (2017) On-the-fly computation of bisimilarity distances. Logical Methods in Computer Science, 13 (2). pp. 1-25. 13. ISSN 1860-5974

Hansen, Helle Hvid and Kupke, Clemens and Rutten, Jan (2017) Stream differential equations : specification formats and solution methods. Logical Methods in Computer Science, 13 (1). pp. 1-52. ISSN 1860-5974

2015

Ghani, Neil and Nordvall Forsberg, Fredrik and Malatesta, Lorenzo (2015) Positive inductive-recursive definitions. Logical Methods in Computer Science, 11 (1). ISSN 1860-5974

Berger, Ulrich and Lawrence, Andrew and Nordvall Forsberg, Fredrik and Seisenberger, Monika (2015) Extracting verified decision procedures : DPLL and resolution. Logical Methods in Computer Science, 11 (1). ISSN 1860-5974

2012

Kupke, Clemens and Kurz, Alexander and Venema, Yde (2012) Completeness for the coalgebraic cover modality. Logical Methods in Computer Science, 8 (3). 2. ISSN 1860-5974

Ghani, Neil and Johann, Patricia and Fumex, Clement (2012) Generic fibrational induction. Logical Methods in Computer Science, 8 (2). ISSN 1860-5974

Atkey, Robert and Johann, Patricia and Ghani, Neil (2012) Refining inductive types. Logical Methods in Computer Science, 8 (2). 9. ISSN 1860-5974

2011

Cirstea, Corina and Kupke, Clemens and Pattinson, Dirk (2011) EXPTIME tableaux for the coalgebraic mu-calculus. Logical Methods in Computer Science, 7 (3). 3. ISSN 1860-5974

Atkey, Robert (2011) Amortised resource analysis with separation logic. Logical Methods in Computer Science, 7 (2). 17.

2009

Hancock, Peter and Pattinson, Dirk and Ghani, Neil (2009) Representations of stream processors using nested fixed points. Logical Methods in Computer Science, 5 (3). pp. 1-17. 9.

Hansen, Helle Hvid and Kupke, Clemens and Pacuit, Eric (2009) Neighbourhood structures : bisimilarity and basic model theory. Logical Methods in Computer Science, 5 (2). 2. ISSN 1860-5974

2008

Kupke, Clemens and Venema, Yde (2008) Coalgebraic automata theory : basic results. Logical Methods in Computer Science, 4 (4). 10. ISSN 1860-5974

This list was generated on Tue Nov 19 04:00:39 2019 GMT.